#include <bits/stdc++.h>
using namespace std;
long long dp[200005][3], a[3], n, l, r;
long long cal(long long mx, long long rem) {
  if (mx < rem) return 0;
  long long dif = mx - rem;
  dif /= 3;
  return dif + 1;
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  cin >> n >> l >> r;
  for (int i = 0; i < 3; ++i) {
    a[i] = (cal(r, i) - cal(l - 1, i) + 1000000007ll) % 1000000007ll;
  }
  dp[0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 3; ++j) {
      for (int k = 0; k < 3; ++k) {
        dp[i][(j + k) % 3] =
            (dp[i][(j + k) % 3] + (a[k] * dp[i - 1][j]) % 1000000007ll) %
            1000000007ll;
      }
    }
  }
  cout << dp[n][0] << '\n';
  return 0;
}
