#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
const int INF = 1e9 + 10;
const long double Pi = 3.141592653589793116, EPS = 1e-9,
                  Gold = ((1 + sqrt(5)) / 2);
map<int, int> lua;
long long f[N][3], n, l, r, A, B, C;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> l >> r;
  A = r / 3 - (l - 1) / 3;
  B = (r + 1) / 3 - (l - 1 + 1) / 3;
  C = (r + 2) / 3 - (l - 1 + 2) / 3;
  f[1][0] = A;
  f[1][1] = B;
  f[1][2] = C;
  for (int i = 2; i <= n; i++) {
    f[i][1] +=
        (f[i - 1][0] * B % 1000000007ll + f[i - 1][1] * A % 1000000007ll +
         f[i - 1][2] * C % 1000000007ll) %
        1000000007ll;
    f[i][0] +=
        (f[i - 1][0] * A % 1000000007ll + f[i - 1][1] * C % 1000000007ll +
         f[i - 1][2] * B % 1000000007ll) %
        1000000007ll;
    f[i][2] +=
        (f[i - 1][0] * C % 1000000007ll + f[i - 1][1] * B % 1000000007ll +
         f[i - 1][2] * A % 1000000007ll) %
        1000000007ll;
  }
  cout << f[n][0];
  return 0;
}
