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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer; 
			  
			
			public class temp4 {
				static class FastReader 
			    { 
			        BufferedReader br; 
			        StringTokenizer st; 
			  
			        public 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()); 
			        } 
			  
			        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 class Reader 
			    { 
			        final private int BUFFER_SIZE = 1 << 16; 
			        private DataInputStream din; 
			        private byte[] buffer; 
			        private int bufferPointer, bytesRead; 
			  
			        public Reader() 
			        { 
			            din = new DataInputStream(System.in); 
			            buffer = new byte[BUFFER_SIZE]; 
			            bufferPointer = bytesRead = 0; 
			        } 
			  
			        public Reader(String file_name) throws IOException 
			        { 
			            din = new DataInputStream(new FileInputStream(file_name)); 
			            buffer = new byte[BUFFER_SIZE]; 
			            bufferPointer = bytesRead = 0; 
			        } 
			  
			        public String readLine() throws IOException 
			        { 
			            byte[] buf = new byte[64]; // line length 
			            int cnt = 0, c; 
			            while ((c = read()) != -1) 
			            { 
			                if (c == '\n') 
			                    break; 
			                buf[cnt++] = (byte) c; 
			            } 
			            return new String(buf, 0, cnt); 
			        } 
			  
			        public int nextInt() throws IOException 
			        { 
			            int ret = 0; 
			            byte c = read(); 
			            while (c <= ' ') 
			                c = read(); 
			            boolean neg = (c == '-'); 
			            if (neg) 
			                c = read(); 
			            do
			            { 
			                ret = ret * 10 + c - '0'; 
			            }  while ((c = read()) >= '0' && c <= '9'); 
			  
			            if (neg) 
			                return -ret; 
			            return ret; 
			        } 
			  
			        public long nextLong() throws IOException 
			        { 
			            long ret = 0; 
			            byte c = read(); 
			            while (c <= ' ') 
			                c = read(); 
			            boolean neg = (c == '-'); 
			            if (neg) 
			                c = read(); 
			            do { 
			                ret = ret * 10 + c - '0'; 
			            } 
			            while ((c = read()) >= '0' && c <= '9'); 
			            if (neg) 
			                return -ret; 
			            return ret; 
			        } 
			  
			        public double nextDouble() throws IOException 
			        { 
			            double ret = 0, div = 1; 
			            byte c = read(); 
			            while (c <= ' ') 
			                c = read(); 
			            boolean neg = (c == '-'); 
			            if (neg) 
			                c = read(); 
			  
			            do { 
			                ret = ret * 10 + c - '0'; 
			            } 
			            while ((c = read()) >= '0' && c <= '9'); 
			  
			            if (c == '.') 
			            { 
			                while ((c = read()) >= '0' && c <= '9') 
			                { 
			                    ret += (c - '0') / (div *= 10); 
			                } 
			            } 
			  
			            if (neg) 
			                return -ret; 
			            return ret; 
			        } 
			  
			        private void fillBuffer() throws IOException 
			        { 
			            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
			            if (bytesRead == -1) 
			                buffer[0] = -1; 
			        } 
			  
			        private byte read() throws IOException 
			        { 
			            if (bufferPointer == bytesRead) 
			                fillBuffer(); 
			            return buffer[bufferPointer++]; 
			        } 
			  
			        public void close() throws IOException 
			        { 
			            if (din == null) 
			                return; 
			            din.close(); 
			        } 
			    } */
				static class Print
			{
				    private final BufferedWriter bw;
				    public Print()
				    {
				        bw=new BufferedWriter(new OutputStreamWriter(System.out));
				    }
			    public void print(String str)throws IOException
				    {
				        bw.append(str);
				    }
				    public void println(String str)throws IOException
				    {
				        print(str);
				        bw.append("\n");
				    }
				    public void close()throws IOException
				    {
				        bw.close();
				    }} 
					
					
				
					public static void main(String[] args) throws IOException {			
						FastReader scn=new FastReader();
						Print pr=new Print();
						int n=scn.nextInt(),l=scn.nextInt(),r=scn.nextInt(),mod=(int) (1e9+7);
						int[][] arr=new int[n+1][3];
						arr[0][0]=1;
						int[] m=new int[3];
						m[0]=r/3-(l-1)/3;
						m[1]=(r+1)/3-l/3;
						m[2]=(r+2)/3-(l+1)/3;
						for(int i=1;i<=n;i++){
							for(int j=0;j<3;j++){
								for(int k=0;k<3;k++){
									arr[i][(j+k)%3]= (int) ((arr[i][(j+k)%3]+(long)1*arr[i-1][j]*m[k])%mod);
								}
							}
						}
						pr.println(arr[n][0]+"");
						
						
						pr.close();
					}
					
			
					public static class node{
						int val;
						int idx;
						public node(int val,int idx){
							this.val=val;this.idx=idx;
						}
					}
					
			}
				