#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll inv2=499122177;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll dx[]={0,1,0,-1,-1,-1,1,1};
ll dy[]={1,0,-1,0,-1,1,-1,1};

ll rui(ll a,ll b,ll mod){
    ll res=1;
    ll x=a;
    while(b){
        if(b&1)res=res*x%mod;
        x=x*x%mod;
        b/=2;
    }
    return res;
}


void solve(){
    ll K;cin>>K;
    vector<ll>D(K),L(K);
    rep(i,K)cin>>D[i]>>L[i];
    vector<ll>z(K);
    rep(i,K){
        ll s=rui(10,L[i],7)-1,inv9=rui(9,5,7);
        s*=inv9;
        s%=7;
        s*=D[i];
        s%=7;
        if(s<0)s+=7;
        z[i]=s;
    }
    vector<vector<ll> >dp(K+1,vector<ll>(7));
    dp[0][0]=1;
    rep(i,K){
        rep(j,7){
            dp[i+1][j]=(dp[i+1][j]+dp[i][j])%INF;
            ll zz=(j*rui(10,L[i],7)%7+z[i])%7;
            dp[i+1][zz]=(dp[i+1][zz]+dp[i][j])%INF;
        }
    }
    ll ans=0;
    rep(i,7){
        ans=(ans+i*dp[K][i])%INF;
    }
    cout<<ans<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}