#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int modEqual(int ma, int m) {
  int res = ma / 3;
  if (ma % 3 >= m) res++;
  return res;
}
int main() {
  long long n, l, r;
  cin >> n >> l >> r;
  long long f[3];
  f[0] = modEqual(r, 0) - modEqual(l - 1, 0);
  f[1] = modEqual(r, 1) - modEqual(l - 1, 1);
  f[2] = modEqual(r, 2) - modEqual(l - 1, 2);
  long long fre[] = {1, 0, 0};
  for (long long i = 0; i < n; i++) {
    long long next[3] = {0};
    for (long long a = 0; a < 3; a++)
      for (long long b = 0; b < 3; b++) next[(a + b) % 3] += fre[a] * f[b];
    for (long long k = 0; k < 3; k++) fre[k] = next[k] % mod;
  }
  cout << fre[0] << endl;
  return 0;
}
