#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 7,mod2 = 1000000007;

vector<vector<long long>> Mul(vector<vector<long long>> A,vector<vector<long long>> B) {
    vector<vector<long long>>ans(A.size(),vector<long long>(A.size()));
    for(int i = 0; i < A.size(); i++) {
        for(int j = 0; j < A.size(); j++) {
            for(int k = 0; k < A.size(); k++) {
                ans[i][j] += A[i][k]*B[k][j]%mod;
                if(ans[i][j] >= mod) ans[i][j] -= mod;
            }
        }
    }
    return ans;
}

vector<vector<long long>> Pow(vector<vector<long long>> A,long long B) {
    vector<vector<long long>>ans(A.size(),vector<long long>(A.size()));
    ans[1][1] = 1;
    while (B) {
        if(1 & B) {
            ans = Mul(ans,A);
        }
        A = Mul(A,A);
        B /= 2;
    }
    return ans;
}

long long modpow(long long a,long long b) {
    long long ans = 1;
    while(b) {
        if(b & 1) {
            (ans *= a) %= mod;
        }
        (a *= a) %= mod;
        b /= 2;
    }
    return ans;
}

int dp[100100][7];

int main() {
    int K;
    cin >> K;
    dp[0][0] = 1;
    vector<int>D(K),L(K);
    for(int i = 0; i < K; i++) {
        cin >> D[i] >> L[i];
        int c = modpow(10,L[i]);
        vector<vector<long long>>tmp(2,vector<long long>(2));
        tmp[0][0] = 1;
        tmp[1][0] = 1;
        tmp[1][1] = 10;
        tmp = Pow(tmp,L[i]);
        int d = D[i]*(tmp[1][0])%mod;
        for(int j = 0; j < 7; j++) {
            dp[i+1][j] += dp[i][j];
            if(dp[i+1][j] >= mod2) dp[i+1][j] -= mod2;
            int nxt = j*c+d;
            nxt %= mod;
            dp[i+1][nxt] += dp[i][j];
            if(dp[i+1][nxt] >= mod2) dp[i+1][nxt] -= mod2;
        }
    }
    int ans = 0;
    for(int i = 1; i < 7; i++) {
        ans += 1ll*i*dp[K][i]%mod2;
        if(ans >= mod2) ans -= mod2;
    }
    cout << ans << endl;
}