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.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader sc = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, sc, out);
        out.close();
    }

    static class Task {
    	public static final long Mod=(long) (1e9+7);
    	
        public void solve(int testNumber, InputReader sc, PrintWriter out) {
           long[] f=new long[3];
           int n=sc.nextInt();
           long l=sc.nextLong();
           long r=sc.nextLong();
           f[0]=r/3-(l-1)/3;
           if(r%3==0&&l%3==0) {
        	   f[1]=f[2]=f[0]-1;
           }else if(l%3==0&&r%3==1) {
        	   f[1]=f[0];
        	   f[2]=f[0]-1;
           }else if(l%3==0&&r%3==2) {
        	   f[1]=f[2]=f[0];
           }else if(l%3==1&&r%3==0) {
        	   f[1]=f[2]=f[0];
           }else if(l%3==1&&r%3==1) {
        	   f[1]=f[0]+1;
        	   f[2]=f[0];
           }else if(l%3==1&&r%3==2) {
        	   f[1]=f[2]=f[0]+1;
           }else if(l%3==2&&r%3==0) {
        	   f[1]=f[0]-1;
        	   f[2]=f[0];
           }else if(l%3==2&&r%3==1) {
        	   f[1]=f[0];
        	   f[2]=f[0];
           }else {
        	   f[2]=f[0]+1;
        	   f[1]=f[0];
           }
          // System.out.println(f[0]+" "+f[1]+" "+f[2]);
           long[][] dp=new long[n+1][3];
           dp[1][0]=f[0];
           dp[1][1]=f[1];
           dp[1][2]=f[2];
           for(int i=2;i<=n;i++) {
        	   if(f[0]>0) {
        		   if(i==1||dp[i-1][0]>0)
        	    	   dp[i][0]=(dp[i-1][0]*f[0])%Mod;
        		   if(dp[i-1][1]>0)
        		       dp[i][1]=(dp[i-1][1]*f[0])%Mod;
        		   if(dp[i-1][2]>0)
        		       dp[i][2]=(dp[i-1][2]*f[0])%Mod;
        	   }
        	   if(f[1]>0) {
        		   if(dp[i-1][2]>0)
        	    	   dp[i][0]+=(dp[i-1][2]*f[1])%Mod;
        		   if(dp[i-1][0]>0)
        		       dp[i][1]+=(dp[i-1][0]*f[1])%Mod;
        		   if(dp[i-1][1]>0)
        		       dp[i][2]+=(dp[i-1][1]*f[1])%Mod;
        	   }
        	   if(f[2]>0) {
        		   if(dp[i-1][1]>0)
        	    	   dp[i][0]+=(dp[i-1][1]*f[2])%Mod;
        		   if(dp[i-1][2]>0)
        		       dp[i][1]+=(dp[i-1][2]*f[2])%Mod;
        		   if(dp[i-1][0]>0)
        		       dp[i][2]+=(dp[i-1][0]*f[2])%Mod;
        	   }
        	   dp[i][0]%=Mod;
        	   dp[i][1]%=Mod;
        	   dp[i][2]%=Mod;
           }
           
           out.println(dp[n][0]);
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

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

    }
}
