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].
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
public class ultrafaste
{
	public static void main(String args[])
	{
		InputStream is=System.in;
		OutputStream os=System.out;
		InputReader sc=new InputReader(is);
		PrintWriter out=new PrintWriter(os);
		TaskC solver=new TaskC();
		solver.solve(1,sc,out);
		out.close();
	}
	
	static class TaskC
	{
		public void solve(int t,InputReader sc,PrintWriter out)
		{
			int n=sc.nextInt();
		int l=sc.nextInt();
        int r=sc.nextInt();
		int p[]=new int[3];	
		int m=1000000007;
		long dp[][]=new long[n+1][3];	
        dp[0][0]=1;
		for(int i=0;i<3;i++)
			p[i]=(r-i+3)/3 - (l-i+2)/3;	
		for(int i=1;i<=n;i++)
		{
			for(int j=0;j<3;j++)
			{
				for(int k=0;k<3;k++)
				{
					dp[i][(j+k)%3]=(dp[i][(j+k)%3]+(dp[i-1][j]*p[k])%m)%m;
				}
			}
		}
			out.println(dp[n][0]);
		}
	}
	static class InputReader {
        private static BufferedReader in;
        private static StringTokenizer tok;

        public InputReader(InputStream in) {
            this.in = new BufferedReader(new InputStreamReader(in));
        }

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

        public String next() {
            try {
                while (tok == null || !tok.hasMoreTokens()) {
                    tok = new StringTokenizer(in.readLine());
                    //tok = new StringTokenizer(in.readLine(), ", \t\n\r\f"); //adds commas as delimeter
                }
            } catch (IOException ex) {
                System.err.println("An IOException was caught :" + ex.getMessage());
            }
            return tok.nextToken();
        }

    }
}
