#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

ll power(ll x, ll y, ll p){
    x%=p;
    ll ret=1;
    while(y){
        if(y&1) ret=ret*x%p;
        x=x*x%p;
        y>>=1;
    }
    return ret;
}
ll divid(ll x, ll y, ll p){
    x%=p;
    return x*power(y,p-2,p)%p;
}

int main(){
    int k; cin >> k;
    VI d(k), l(k);
    REP(i,k) cin >> d[i] >> l[i];
    ll d9=divid(1,9,7);
    VI dp(7,0); dp[0]=1;
    REP(i,k){
        ll m=(power(10,l[i],7)-1+7)*d9%7*d[i]%7;
        VI ndp(7,0);
        REP(j,7) ndp[(j*power(10,l[i],7)+m)%7]=dp[j];
        REP(j,7) dp[j]=(dp[j]+ndp[j])%MOD;
    }
    ll ans=0;
    REP(i,7) ans=(ans+dp[i]*i%MOD)%MOD;
    cout << ans << endl;
    return 0;
}