using System; using System.IO; using System.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; class Program { static readonly int Mod = (int)1e9 + 7; public void Solve() { int N = Reader.Int(); var table = Reader.StringArray(N * 2); long ans = 1; for (int i = 0; i < N; i++) { long x = Fibonacci(long.Parse(table[i * 2]) + 2, Mod); long pow = 0; foreach (var c in table[i * 2 + 1]) pow = (pow * 10 + c - '0') % (Mod - 1); if (x == 0) { ans = 0; break; } ans = ans * (long)BigInteger.ModPow(x, pow, Mod) % Mod; } Console.WriteLine(ans); } static long Fibonacci(long n, long mod) { // Fib(1) = 1, Fib(2) = 1, Fib(3) = 2, ... long[][] A = new long[2][] { new long[] { 1, 1 }, new long[] { 1, 0 } }; long[][] res = new long[2][] { new long[] { 1, 0 }, new long[] { 0, 1 } }; while (n > 0) { if ((n & 1) == 1) res = MatrixModMult(res, A, mod); A = MatrixModMult(A, A, mod); n >>= 1; } return res[1][0]; } static long[][] MatrixModMult(long[][] A, long[][] B, long mod) { long[][] res = new long[2][] { new long[2], new long[2] }; res[0][0] = (A[0][0] * B[0][0] + A[0][1] * B[1][0]) % mod; res[0][1] = (A[0][0] * B[0][1] + A[0][1] * B[1][1]) % mod; res[1][0] = (A[1][0] * B[0][0] + A[1][1] * B[1][0]) % mod; res[1][1] = (A[1][0] * B[0][1] + A[1][1] * B[1][1]) % mod; return res; } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }