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;

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

    static class TaskC {
        int MOD = 1000000007;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int l = in.nextInt();
            int r = in.nextInt();

//        int lr = r - l + 1;
//        int all = lr / 3;
//        int zeroes = all;
//        int ones = all;
//        int twos = all;

            long rr = r + 1;
            while (rr % 3 != l % 3) rr--;
            long zeroes = (rr - l) / 3;
            long ones = (rr - l) / 3;
            long twos = (rr - l) / 3;
            while (rr < r + 1) {
                if (rr % 3 == 0) {
                    zeroes++;
                } else if (rr % 3 == 1) {
                    ones++;
                } else {
                    twos++;
                }
                rr++;
            }

            long sum0 = zeroes;
            long sum1 = ones;
            long sum2 = twos;

            for (int i = 1; i < n; i++) {
                long sum00 = sum0 * zeroes + sum1 * twos + sum2 * ones;
                long sum11 = sum0 * ones + sum1 * zeroes + sum2 * twos;
                long sum22 = sum0 * twos + sum1 * ones + sum2 * zeroes;
                sum0 = sum00 % MOD;
                sum1 = sum11 % MOD;
                sum2 = sum22 % MOD;
            }
            out.println(sum0);
//        out.println(sum1);
//        out.println(sum2);
//        out.println(sum0 + sum1 + sum2);
//        out.println((sum0 + sum1 + sum2) % MOD);
        }

    }

    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();
        }

    }
}

