#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const T min(const V<T>& v) { return *min_element(all(v)); }
template<class T> inline constexpr const T max(const V<T>& v) { return *max_element(all(v)); }
template<class T> inline V<T>& operator++(V<T>& v) { for (T& a : v)++a; return v; }
template<class T> inline V<T>& operator--(V<T>& v) { for (T& a : v)--a; return v; }

int m7p(int n, int p) {
    int res = 0, cur = 1;
    for (; p; p >>= 1) {
        if (p & 1)res = (res + cur) % 7;
        cur = cur * n % 7;
    }
    return res;
}

#include <atcoder/modint>
using mint = atcoder::modint1000000007;
int main() {
    init();

    int k; cin >> k;
    VI d(k), l(k);
    FOR(i, 0, k)cin >> d[i] >> l[i];
    reverse(all(d));
    reverse(all(l));

    VL p10(6, 1);
    FOR(i, 1, 6)p10[i] = p10[i - 1] * 10;
    auto ma = vec<ll>(10, 7);
    FOR(i, 0, 10)FOR(j, 0, 7)FOR(_, 0, j) {
        ma[i][j] = ma[i][j] * 10 + i;
    }

    auto dp = vec<mint>(k + 1, 7, 6);
    dp[0][0][0] = 1;
    FOR(i, 0, k)FOR(s, 0, 7)FOR(m, 0, 6) {
        //使う
        dp[i + 1][(s + ma[d[i]][l[i] % 6] * p10[m] * p10[(l[i] - l[i] % 6) % 6]) % 7][(m + l[i]) % 6] += dp[i][s][m];
        //使わない
        dp[i + 1][s][m] += dp[i][s][m];
    }
    mint ans = 0;
    FOR(s, 0, 7)FOR(m, 0, 6)ans += dp[k][s][m] * s;
    print(ans.val());

    return 0;
}