#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

ll pow_mod(ll x, ll n, ll mod){
    ll ret = 1;
    while(n > 0){
        if(n & 1) ret = (ret*x)%mod;
        x = x*x%mod;
        n >>=1;
    }
    return ret;
}

int main(){
    ll k;
    cin >> k;

    vector<ll> d(k), l(k);
    rep(i, k) cin >> d[i] >> l[i];

    vector<ll> dp(7, 0);
    dp[0] = 1;
    ll inv9 = pow_mod(9, 5, 7);
    for(ll i=0; i<=k-1; i++){
        ll prefix = 0;
        prefix = d[i]%7;
        prefix *= (pow_mod(10, l[i], 7)+6)%7;
        prefix %= 7;
        prefix *= inv9;
        prefix %= 7;

        vector<ll> dp2(7, 0);
        rep(j, 7) dp2[j] = dp[j];

        rep(j, 7){
            ll tmp = (j * pow_mod(10, l[i], 7))%7;
            tmp += prefix;
            tmp %= 7;
            dp2[tmp] += dp[j];
            dp2[tmp] %= MOD;
        }

        rep(j, 7) dp[j] = dp2[j];
    }

    ll ans = 0;
    rep(i, 7){
        ans += (i*dp[i])%MOD;
        ans %= MOD;
    }
    cout << ans << endl;
}