#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
template <typename T, typename U>
inline istream &operator>>(istream &in, pair<T, U> &p) {
  in >> p.first >> p.second;
  return in;
}
template <typename T>
inline istream &operator>>(istream &in, vector<T> &v) {
  for (T &x : v) in >> x;
  return in;
}
const ll MOD = 1e9 + 7;
inline ll md(ll x, ll M = MOD) {
  x %= M;
  return ((x < 0) ? (x + M) : x);
}
ll f(ll l, ll r, ll rem, ll mod = 3) {
  ll ans = 0;
  ans += ((r + rem) / mod);
  if (l) ans -= ((l - 1 + rem) / mod);
  return ans;
}
void solve(ll &tc) {
  ll n, l, r;
  cin >> n >> l >> r;
  ll dp[n + 1][3];
  memset(dp, 0, sizeof(dp));
  for (ll j = 0; j < 3; j++) {
    dp[1][j] = f(l, r, j);
  }
  for (ll i = 2; i <= n; i++) {
    for (ll j = 0; j < 3; j++) {
      for (ll k = 0; k < 3; k++) {
        for (ll m = 0; m < 3; m++) {
          if ((k + m) % 3 == j) {
            dp[i][j] = md(dp[i][j] + dp[i - 1][k] * f(l, r, m));
          }
        }
      }
    }
  }
  cout << dp[n][0] << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ll rep = 3;
  while (rep--) {
    ll tc = 1;
    for (ll i = 1; i <= tc; i++) {
      if (0) cerr << "Case #" << i << "\n";
      solve(i);
    }
    if (1) break;
  }
  return 0;
}
