#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = atcoder::modint;
int mod = 7;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
mint calc(int d, int l, mint inv9) {
	mint ret = d;
	ret *= (pow_mod(10, l, mod) - 1);
	ret *= inv9;
	//cout << ret.val() << "?" << endl;
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	mint::set_mod(mod);
	int k; cin >> k;
	vector<int>d(k), l(k);
	mint inv9 = inv_mod(9, mod);
	rep(i, k)cin >> d[i] >> l[i];
	vector<long long>cnt(7);
	cnt[0] = 1;
	rep(i, k) {
		vector<long long>tmp = cnt;
		mint memo = calc(d[i], l[i], inv9);
		rep(j, 7) {
			mint memo2 = j * pow_mod(10, l[i], mod) + memo;
			tmp[memo2.val()] += cnt[j];
			tmp[memo2.val()] %= 1000000007;
		}
		swap(tmp, cnt);
	}
	long long ans = 0;
	rep(i, 7)ans = (ans + cnt[i] * i) % 1000000007;
	cout << ans << endl;
	return 0;
}