#include using namespace std; const int MOD = 1000000007; struct mint { int val; mint() : val(0) {} mint(long long v) { if (abs(v) >= MOD) { v %= MOD; } if (v < 0) { v += MOD; } val = v; } mint &operator++() { val++; if (val == MOD) { val = 0; } return *this; } mint &operator--() { if (val == 0) { val = MOD; } val--; return *this; } mint &operator+=(const mint &x) { val += x.val; if (val >= MOD) { val -= MOD; } return *this; } mint &operator-=(const mint &x) { val -= x.val; if (val < 0) { val += MOD; } return *this; } mint &operator*=(const mint &x) { val = (int)((long long)val * x.val % MOD); return *this; } mint &operator/=(const mint &x) { *this *= x.inv(); return *this; } mint operator-() { return mint() - *this; } mint pow(long long n) const { mint x = 1, r = *this; while (n) { if (n & 1) { x *= r; } r *= r; n >>= 1; } return x; } mint inv() const { return pow(MOD - 2); } friend mint operator+(const mint &x, const mint &y) { return mint(x) += y; } friend mint operator-(const mint &x, const mint &y) { return mint(x) -= y; } friend mint operator*(const mint &x, const mint &y) { return mint(x) *= y; } friend mint operator/(const mint &x, const mint &y) { return mint(x) /= y; } friend bool operator==(const mint &x, const mint &y) { return x.val == y.val; } friend bool operator!=(const mint &x, const mint &y) { return x.val != y.val; } friend std::ostream &operator<<(std::ostream &os, const mint &x) { return os << x.val; } friend std::istream &operator>>(std::istream &is, mint &x) { long long v; is >> v; x = mint(v); return is; } }; int main() { int k; cin >> k; int d[200005], l[200005]; for (int i = 0; i < k; i++) { cin >> d[i] >> l[i]; } int p[6]; p[0] = 1; for (int i = 1; i < 6; i++) { p[i] = p[i - 1] * 10 % 7; } mint e[7] = {1}; for (int i = 0; i < k; i++) { int x = (p[l[i] % 6] + 6) * 4 * d[i] % 7; mint f[7]{0}; for (int j = 0; j < 7; j++) { f[j] += e[j]; f[(j * p[l[i] % 6] + x) % 7] += e[j]; } swap(e, f); } mint ans = 0; for (int j = 0; j < 7; j++) { ans += e[j] * j; } cout << ans << endl; }