#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long N, l, r, dp[200005][3];
void countt(long long &a, long long &b, long long &c, long long x) {
  a = b = c = 0;
  while (x % 3) {
    if (x % 3 == 1)
      b++;
    else
      c++;
    x--;
  }
  a = x / 3 + 1;
  b += x / 3;
  c += x / 3;
}
int main() {
  long long a, b, c;
  cin >> N >> l >> r;
  long long da, db, dc;
  countt(da, db, dc, l - 1);
  countt(a, b, c, r);
  a -= da, b -= db, c -= dc;
  dp[1][0] = a, dp[1][1] = b, dp[1][2] = c;
  for (int i = 2; i <= N; i++) {
    dp[i][0] = (((dp[i - 1][0] * a) % mod + (dp[i - 1][1] * c) % mod) % mod +
                (dp[i - 1][2] * b) % mod) %
               mod;
    dp[i][1] = (((dp[i - 1][0] * b) % mod + (dp[i - 1][1] * a) % mod) % mod +
                (dp[i - 1][2] * c) % mod) %
               mod;
    dp[i][2] = (((dp[i - 1][0] * c) % mod + (dp[i - 1][1] * b) % mod) % mod +
                (dp[i - 1][2] * a) % mod) %
               mod;
  }
  cout << dp[N][0];
  return 0;
}
