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
 *
 * @author Abhas Jain
 */
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);
        CAyoubAndLostArray solver = new CAyoubAndLostArray();
        solver.solve(1, in, out);
        out.close();
    }

    static class CAyoubAndLostArray {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.ni();
            long l = in.nl();
            long r = in.nl();
            long[][] dp = new long[n][3];
            long mod = (long) 1e9 + 7;
            long tot = (r - l + 1);
            long c0 = 0, c1 = 0, c2 = 0;
            if (l % 3 == 0) {
                c0 = (tot + 2) / 3;
                c1 = (tot + 1) / 3;
                c2 = tot / 3;
            } else if (l % 3 == 1) {
                c1 = (tot + 2) / 3;
                c2 = (tot + 1) / 3;
                c0 = (tot) / 3;
            } else {
                c2 = (tot + 2) / 3;
                c0 = (tot + 1) / 3;
                c1 = (tot) / 3;
            }
            dp[0][1] = c1;
            dp[0][0] = c0;
            dp[0][2] = c2;
            for (int i = 1; i < n; ++i) {
                dp[i][1] = ((dp[i - 1][1] * c0) % mod + (dp[i - 1][0] * c1) % mod + (dp[i - 1][2] * c2) % mod) % mod;
                dp[i][0] = ((dp[i - 1][1] * c2) % mod + (dp[i - 1][2] * c1) % mod + (dp[i - 1][0] * c0) % mod) % mod;
                dp[i][2] = ((dp[i - 1][1] * c1) % mod + (dp[i - 1][2] * c0) % mod + (dp[i - 1][0] * c2) % mod) % mod;
            }
            // out.println(c0 + " " + c1 + " " + c2);
            out.print(dp[n - 1][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 ni() {
            return Integer.parseInt(next());
        }

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

    }
}

