#include <bits/stdc++.h>
const double pi = 3.14159265358979323846;
using namespace std;
long long fastexp(long long a, long long b) {
  long long answer = 1;
  long long temp = a;
  while (b > 0) {
    if (b & 1) answer *= (temp);
    temp *= temp;
    b >>= 1;
  }
  return answer;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  ;
  long long** dp = new long long*[3];
  for (long long i = 0; i < 3; i++) {
    dp[i] = new long long[n + 1];
  }
  dp[0][0] = 1;
  dp[1][0] = 1;
  dp[2][0] = 1;
  long long count_0, count_1, count_2;
  count_2 = 0;
  count_1 = 0;
  count_0 = 0;
  long long l;
  cin >> l;
  ;
  long long r;
  cin >> r;
  ;
  long long u_0, u_1, u_2;
  long long l_0, l_1, l_2;
  u_0 = u_1 = u_2 = (r / 3);
  r %= 3;
  ;
  if (r == 1)
    u_1++;
  else if (r == 2) {
    u_1++;
    u_2++;
  }
  l--;
  l_0 = l_2 = l_1 = (l / 3);
  l %= 3;
  if (l == 1)
    l_1++;
  else if (l == 2) {
    l_1++;
    l_2++;
  }
  count_0 = u_0 - l_0;
  count_1 = u_1 - l_1;
  count_2 = u_2 - l_2;
  dp[0][1] = count_0;
  dp[1][1] = count_1;
  dp[2][1] = count_2;
  for (long long i = 2; i <= n; i++) {
    long long j = 0;
    dp[0][i] = (dp[0][i - 1] * count_0 + dp[1][i - 1] * count_2 +
                dp[2][i - 1] * count_1) %
               1000000007;
    dp[1][i] = (dp[0][i - 1] * count_1 + dp[1][i - 1] * count_0 +
                dp[2][i - 1] * count_2) %
               1000000007;
    dp[2][i] = (dp[0][i - 1] * count_2 + dp[1][i - 1] * count_1 +
                dp[2][i - 1] * count_0) %
               1000000007;
  }
  cout << dp[0][n] << endl;
  return 0;
}
