#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int n, l, r;
long long mod0, mod1, mod2, f[200100][3];
int main() {
  cin >> n >> l >> r;
  mod0 = r / 3 - l / 3;
  mod1 = mod0;
  mod2 = mod0;
  if (l % 3 == 0) mod0++;
  if (l % 3 == 2) mod1--;
  if (r % 3 == 1) mod1++;
  if (r % 3 == 2) mod1++, mod2++;
  f[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    f[i][0] = (f[i - 1][0] * mod0) % mod + (f[i - 1][1] * mod2) % mod +
              (f[i - 1][2] * mod1) % mod;
    f[i][0] %= mod;
    f[i][1] = (f[i - 1][1] * mod0) % mod + (f[i - 1][2] * mod2) % mod +
              (f[i - 1][0] * mod1) % mod;
    f[i][1] %= mod;
    f[i][2] = (f[i - 1][0] * mod2) % mod + (f[i - 1][1] * mod1) % mod +
              (f[i - 1][2] * mod0) % mod;
    f[i][2] %= mod;
  }
  cout << f[n][0] << endl;
  return 0;
}
