#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

const int MOD=1e9+7;

int k;
ll D[100010],L[100010],dp[100010][7];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    modint::set_mod(7);
    cin>>k;
    rep(i,k){
        cin>>D[i]>>L[i];
    }
    dp[0][0]=1;
    rep(i,k){
        int s=mint(10).pow(L[i]).val(),t=(((mint(10).pow(L[i])-1)/9)*D[i]).val();
        rep(j,7){
            dp[i+1][j]+=dp[i][j];
            dp[i+1][(j*s+t)%7]+=dp[i][j];
        }
        rep(j,7){
            dp[i+1][j]%=MOD;
        }
    }
    ll ans=0;
    rep(i,7){
        ans+=i*dp[k][i];
        ans%=MOD;
    }
    cout<<ans<<"\n";
}