C. Ayoub and Lost Array

Ayoub had an array aa of integers of size nn and this array had two interesting properties:

• All the integers in the array were between ll and rr (inclusive).
• The sum of all the elements was divisible by 33 .

Unfortunately, Ayoub has lost his array, but he remembers the size of the array nn and the numbers ll and rr , so he asked you to find the number of ways to restore the array.

Since the answer could be very large, print it modulo 109+7109+7 (i.e. the remainder when dividing by 109+7109+7 ). In case there are no satisfying arrays (Ayoub has a wrong memory), print 00 .

Input

The first and only line contains three integers nn , ll and rr (1≤n≤2⋅105,1≤l≤r≤1091≤n≤2⋅105,1≤l≤r≤109 ) — the size of the lost array and the range of numbers in the array.

Output

Print the remainder when dividing by 109+7109+7 the number of ways to restore the array.

Examples

Input

Copy

2 1 3

Output

Copy

3

Input

Copy

3 2 2

Output

Copy

1

Input

Copy

9 9 99

Output

Copy

711426616

Note

In the first example, the possible arrays are : [1,2],[2,1],[3,3][1,2],[2,1],[3,3] .

In the second example, the only possible array is [2,2,2][2,2,2] .

原本以为是个王者，没想到是个青铜题

#include<stdio.h>
#include<iostream>
using namespace std;
long long dp[200005][3];
const long long mod=1000000007;
int main()
{
	int n,l,r;
	cin>>n>>l>>r;
	//求余数为0，1，2的数的个数
	long long a0,a1,a2;// 1,2的地位相同，因此不必具体求出 
	long long sum=r-l+1;
	a0=r/3-(l-1)/3;
	sum-=a0;
	a1=sum/2;
	a2=sum-a1 ;
	dp[1][0]=a0;
	dp[1][1]=a1;
	dp[1][2]=a2;
	for(int i=2;i<=n;i++)
	{
		dp[i][0]=(dp[i-1][1]*a2+dp[i-1][0]*a0+dp[i-1][2]*a1)%mod;
		dp[i][1]=(dp[i-1][1]*a0+dp[i-1][0]*a1+dp[i-1][2]*a2)%mod;
		dp[i][2]=(dp[i-1][1]*a1+dp[i-1][0]*a2+dp[i-1][2]*a0)%mod;
	}
	printf("%lld\n",dp[n][0]);
}