#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000;
const long long mod = 1e9 + 7;
long long dp[MAXN + 5][4];
long long getAns(int n, int l, int r) {
  int cnt[4] = {0};
  if (r - l < 10) {
    for (int i = l; i <= r; i++) {
      cnt[i % 3]++;
    }
  } else {
    while (l % 3 != 0) {
      cnt[l % 3]++;
      l++;
    }
    while (r % 3 != 2) {
      cnt[r % 3]++;
      r--;
    }
    cnt[0] += (r - l + 1) / 3;
    cnt[1] += (r - l + 1) / 3;
    cnt[2] += (r - l + 1) / 3;
  }
  dp[0][0] = 1;
  dp[0][1] = 0;
  dp[0][2] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 3; j++) {
      dp[i][j] = 0;
      for (int k = 0; k < 3; k++) {
        dp[i][j] += dp[i - 1][(j - k + 3) % 3] * cnt[k];
        dp[i][j] %= mod;
      }
    }
  }
  return dp[n][0];
}
int main() {
  int n, l, r;
  while (cin >> n >> l >> r) {
    cout << getAns(n, l, r) << endl;
  }
}
