#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}

const ll mod = 1e9+7;

inline ll modpow(ll a,ll n){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%mod)if(n&1)p=p*a%mod;return p;}

ll n, m[65][2][2], t[2][2], e[2][2] = {1,0,0,1}, tmp[2][2], c, ans, q;
int co;
string d;

inline void merge(ll a[2][2], ll b[2][2], ll c[2][2]){
  ll g;
  FOR(i, 0, 2){
    FOR(j, 0, 2){
      g = 0;
      FOR(k, 0, 2) g = (g + a[i][k] * b[k][j]) % mod;
      tmp[i][j] = g;
    }
  }
  FOR(i, 0, 2)FOR(j, 0, 2) c[i][j] = tmp[i][j];
}

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  ans = 1;
  m[0][0][0] = 0;
  m[0][0][1] = 1;
  m[0][1][0] = 1;
  m[0][1][1] = 1;
  FOR(i, 1, 65)merge(m[i-1], m[i-1], m[i]);
  FOR(i, 0, n){
    cin >> c >> d;
    memmove(t, e, sizeof(e));
    co = 0;
    while(c > 0){
      if(c & 1) merge(t,  m[co], t);
      co++;
      c >>= 1;
    }
    q = (t[0][1] + t[1][1]) % mod;
    FORR(j, sz(d)-1, 0){
      co = d[j]-'0';
      ans = (ans * modpow(q, co)) % mod;
      q = modpow(q, 10);
    }
  }
  cout << ans << endl;
  return 0;
}