#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000
#define MOD 1000000007

typedef long long ll;

map<ll,int> m;

ll dfs(ll c) {
    if (m.count(c))
        return m[c];
    if (c < 1)
        return m[c] = 1;
    else if (c == 1)
        return m[c] = 2;
    else
        return m[c] = (dfs(c/2)*dfs(c-c/2-1)%MOD + dfs(c/2-1)*dfs(c-c/2-2)%MOD) % MOD;
}

int main() {
    int i, n;
    ll ans;
    cin >> n;
    ans = 1;
    rep (i,n) {
        ll c, d;
        string sd;
        cin >> c >> sd;
        d = 0;
        for (auto chr : sd)
            d = (d*10 + chr - '0') % MOD;
        ans *= dfs(c) * d % MOD;
        ans %= MOD;
    }
    cout << ans << endl;
    return 0;
}