import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	final long MOD=(long)1e9+7;
	
	long ADD(long a,long b) {
		return a+b>=MOD?a+b-MOD:a+b;
	}
	
	long[][] mul(long[][] a,long[][] b){
		long[][] ret=new long[a.length][b[0].length];
		for(int i=0;i<a.length;++i) {
			for(int j=0;j<b[i].length;++j) {
				for(int k=0;k<a[i].length;++k) {
					ret[i][j]=ADD(ret[i][j],a[i][k]*b[k][j]%MOD);
				}
			}
		}
		return ret;
	}
	
	long[][] pow(long[][] a,long n){
		long[][] ret=new long[a.length][a.length];
		for(int i=0;i<a.length;++i)ret[i][i]=1;
		for(;n>0;n>>=1,a=mul(a,a))if(n%2==1)ret=mul(ret,a);
		return ret;
	}
	
	long pow(long a,long n) {
		long ret=1;
		for(;n>0;n>>=1,a=a*a%MOD)if(n%2==1)ret=ret*a%MOD;
		return ret;
	}
	
	long fib(long c) {
		long[][] mat= {{1,1},{1,0}};
		mat=pow(mat,c-1);
		return mat[0][0];
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		long ans=1;
		BigInteger MODIDX=BigInteger.valueOf(2*(MOD-1));
		while(N-->0) {
			long C=sc.nextLong();
			long D=new BigInteger(sc.next()).remainder(MODIDX).longValue();
			ans=ans*pow(fib(C+2),D)%MOD;
		}
		System.out.println(ans);
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}




class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}