#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll INF = 1145141919;
const ll MOD = 1000000007;
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}

ll pls(ll a, ll b){
    return (a + b) % MOD;
}

ll mlt(ll a, ll b){
    return (a * b) % MOD;
}

class mat{
    public:
    ll A, B, C, D;
    mat(ll a, ll b, ll c, ll d){
        A = a;
        B = b;
        C = c;
        D = d;
    }
    mat(mat x, mat y){
        A = pls(mlt(x.A, y.A), mlt(x.B, y.C));
        B = pls(mlt(x.A, y.B), mlt(x.B, y.D));
        C = pls(mlt(x.C, y.A), mlt(x.D, y.C));
        D = pls(mlt(x.C, y.B), mlt(x.D, y.D));
    }
    void add(mat x){
        A = pls(A, x.A);
        B = pls(B, x.B);
        C = pls(C, x.C);
        D = pls(D, x.D);
    }
};

ll f(ll b){
    mat m(1, 1, 1, 0);
    mat ret(1, 0, 0, 1);
    while(b > 0){
        if(b & 1)ret = mat(ret, m);
        m = mat(m, m);
        b >>= 1;
    }
    return pls(ret.A, ret.B);
}

ll md(string s){
    ll ret = 0;
    rep(i, s.size()){
        ret = (ret * 10 + s[i] - '0') % MOD;
    }
    return ret;
}

int main(){

    ll N;
    cin >> N;
    ll ans = 1;
    rep(i, N){
        ll tmp;
        ll c;
        cin >> c;
        tmp = f(c);
        string d;
        cin >> d;
        tmp = mlt(tmp, md(d));
        ans = mlt(ans, tmp);
    }
    cout << ans << endl;

    return 0;
}