import sys
from operator import itemgetter
from collections import defaultdict, deque
import heapq
from heapq import heapify, heappop, _heapify_max, heappush
from bisect import bisect_left, bisect_right
import math
import itertools
import copy

stdin=sys.stdin
#sys.setrecursionlimit(10 ** 7)
## import pypyjit
## pypyjit.set_param('max_unroll_recursion=-1')

ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
Yp=lambda:print('Yes')
Np=lambda:print('No')
inf = 1 << 60
inf = float('inf')
mod = 10 ** 9 + 7
#mod = 998244353
eps = 1e-9
sortkey1 = itemgetter(0)
sortkey2 = lambda x: (x[0], x[1])



###############################################################

K = ip()
DL = [lp() for _ in range(K)]
dp = [0 for _ in range(7)]
dp[0] = 1
for (d, l) in DL:
    prev = dp
    dp = [0 for _ in range(7)]
    for i in range(7):
        dp[i] += prev[i]
        dp[i] %= mod

    ten = pow(10, l, 7)
    p, q = divmod(l, 6)
    if q:
        x = int(str(d) * q) % 7
    else:
        x = 0
    x = x * pow(10, 6 * p, 7)
    x %= 7
    for i in range(7):
        j = (i * ten + x) % 7
        dp[j] += prev[i]
        dp[j] %= mod

ans = 0
for i in range(7):
    ans += i * dp[i]
    ans %= mod
print(ans)
exit()