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].
// 14-Feb-2021
import java.util.*;
import java.io.*;

public class D {
	static class FastReader {

		BufferedReader br;
		StringTokenizer st;

		private FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		int[] nextIntArrayOne(int n) {
			int[] a = new int[n + 1];
			for (int i = 1; i < n + 1; i++)
				a[i] = nextInt();
			return a;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	static int mod = (int)(1e9 + 7);
	public static void main(String[] args) {
		FastReader s = new FastReader();
		StringBuilder str = new StringBuilder();

		int n = s.nextInt(), l = s.nextInt(), r = s.nextInt();
		
		long arr[] = new long[3];
		
		
		arr[0] = (r - l + 1) / 3;
		arr[1] = arr[0];
		arr[2] = arr[0];
		
		if((r-l+1) % 3 == 1) {
	        arr[l%3]++;
	    }
	   
		if((r-l+1) % 3 == 2) {
	        arr[l % 3]++;
	        arr[(l+1) % 3]++;
		}
		
		long dp[][] = new long[n + 1][3];
		
		dp[1][0] = arr[0];
		dp[1][1] = arr[1];
		dp[1][2] = arr[2];
		
		for(int i = 2; i <= n; i++) {
			
			dp[i][0] = (dp[i - 1][0] * arr[0] + dp[i - 1][1] * arr[2] + dp[i - 1][2] * arr[1]) % mod;
			dp[i][1] = (dp[i - 1][0] * arr[1] + dp[i - 1][1] * arr[0] + dp[i - 1][2] * arr[2]) % mod;
			dp[i][2] = (dp[i - 1][0] * arr[2] + dp[i - 1][1] * arr[1] + dp[i - 1][2] * arr[0]) % mod;
		}
		
		System.out.println(dp[n][0]);
		
		

		
	
	}

}
