Ayoub had an array a of integers of size n and this array had two interesting properties: 

  * All the integers in the array were between l and r (inclusive). 
  * The sum of all the elements was divisible by 3. 



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

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

Input

The first and only line contains three integers n, l and r (1 ≤ n ≤ 2 ⋅ 10^5 , 1 ≤ l ≤ r ≤ 10^9) — the size of the lost array and the range of numbers in the array.

Output

Print the remainder when dividing by 10^9 + 7 the number of ways to restore the array.

Examples

Input


2 1 3


Output


3


Input


3 2 2


Output


1


Input


9 9 99


Output


711426616

Note

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

In the second example, the only possible array is [2, 2, 2].
MOD = 1000000007
MOD2 = 998244353
ii = lambda: int(input())
si = lambda: input()
dgl = lambda: list(map(int, input()))
f = lambda: map(int, input().split())
il = lambda: list(map(int, input().split()))
ls = lambda: list(input())
let = '@abcdefghijklmnopqrstuvwxyz'
n,l,r=f()
arr=[[0 for i in range(3)] for j in range(n)]
th=[r//3-(l-1)//3,(r-1)//3-(l-2)//3,(r-2)//3-(l-3)//3]
arr[0][0]=th[0]
arr[0][1]=th[1]
arr[0][2]=th[2]
for i in range(1,n):
    arr[i][0]=((arr[i-1][0]*th[0])%MOD+(arr[i-1][1]*th[2])%MOD+(arr[i-1][2]*th[1])%MOD)%MOD
    arr[i][1]=((arr[i-1][1]*th[0])%MOD+(arr[i-1][0]*th[1])%MOD+(arr[i-1][2]*th[2])%MOD)%MOD
    arr[i][2]=((arr[i-1][2]*th[0])%MOD+(arr[i-1][0]*th[2])%MOD+(arr[i-1][1]*th[1])%MOD)%MOD
print(arr[n-1][0])
