using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using Enu = System.Linq.Enumerable;

class Program
{
    static readonly int Mod = (int)1e9 + 7;
    void Add(ref long a, long b) { if ((a += b) >= Mod) a -= Mod; }

    void Solve()
    {
        int N = reader.Int();
        long[] Cs = new long[N];
        string[] SDs = new string[N];
        long[] Ds = new long[N];

        for (int i = 0; i < N; i++)
        {
            Cs[i] = reader.Long();
            SDs[i] = reader.String();
        }
        for (int i = 0; i < N; i++)
        {
            string s = SDs[i];
            long p10 = 1;
            for (int si = s.Length - 1; si >= 0; si--)
            {
                Ds[i] = (Ds[i] + (s[si] - '0') * p10) % (Mod - 1);
                p10 = p10 * 10 % (Mod - 1);
            }
        }

        long ans = 1;
        for (int i = 0; i < N; i++)
        {
            long c = Cs[i];
            long num = Ds[i];
            var mat = new long[2][];
            mat[0] = new long[] { 1, 1 }; // x
            mat[1] = new long[] { 1, 0 }; // o
            mat = MatrixModPower(mat, c - 1, Mod);
            long curr = (mat[0][0] + mat[0][1] + mat[1][0] + mat[1][1]) % Mod;
            if (curr == 0) { ans = 0; break; }
            curr = ModPower(curr, num);
            ans *= curr;
            ans %= Mod;
        }

        Console.WriteLine(ans);
    }

    static long ModPower(long x, long n) // x ^ n
    {
        long res = 1;
        while (n > 0)
        {
            if ((n & 1) == 1) { res = (res * x) % Mod; }
            x = (x * x) % Mod;
            n >>= 1;
        }
        return res;
    }

    static long[][] MatrixModPower(long[][] A, long n, long mod)
    {
        int size = A.Length;
        long[][] res = new long[size][];
        for (int i = 0; i < size; i++) { res[i] = new long[size]; res[i][i] = 1; }
        while (n > 0)
        {
            if ((n & 1) == 1) res = MatrixModMult(res, A, mod);
            A = MatrixModMult(A, A, mod);
            n >>= 1;
        }
        return res;
    }
    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;
    }


    Reader reader = new Reader(Console.In);
    static void Main() { new Program().Solve(); }
}

class Reader
{
    private readonly TextReader reader;
    private readonly char[] separator = { ' ' };
    private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;
    private string[] A = new string[0];
    private int i;

    public Reader(TextReader r) { reader = r; }
    public bool HasNext() { return Enqueue(); }
    public string String() { return Dequeue(); }
    public int Int() { return int.Parse(Dequeue()); }
    public long Long() { return long.Parse(Dequeue()); }
    public double Double() { return double.Parse(Dequeue()); }
    public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }
    public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public string Line() { return reader.ReadLine().Trim(); }
    private string[] Split(string s) { return s.Split(separator, removeOp); }
    private bool Enqueue()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return Enqueue();
        A = Split(line);
        i = 0;
        return true;
    }
    private string Dequeue() { Enqueue(); return A[i++]; }
}