#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint1000000007;
#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 vector<int>M={};

int k;
int D[100010],L[100010];
mint dp[100010][6][7];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>k;
    rrep(i,k){
        cin>>D[i]>>L[i];
        L[i]%=6;
    }
    dp[0][0][0]=1;
    rep(i,k){
        int c=0;
        rep(j,L[i])c=(10*c+D[i])%7;
        rep(j,6){
            rep(l,7){
                dp[i+1][j][l]+=dp[i][j][l];
                dp[i+1][(j+L[i])%6][(l+c)%7]+=dp[i][j][l];
            }
            c=10*c%7;
        }
    }
    mint ans=0;
    rep(i,6)rep(j,7)ans+=j*dp[k][i][j];
    cout<<ans.val()<<"\n";
}