mod = 998244353
N = 5 * 10 ** 7 + 2
F = [1] * N
for i in range(2, N):
    F[i] = F[i-1]*i%mod

def comb(a, b): #組合せ
    if b < 0:
        return 0
    if a < b:
        return 0
    return F[a] * pow(F[a], -1, mod) * pow(F[a-b], -1, mod) % mod

ans = 1
k = int(input())
cnt = 0
for _ in range(k):
    l, m = map(int, input().split())
    tmp = 1
    for i in range(m):
        tmp = comb(l*(i+1)-1, l-1) * tmp % mod
    ans = ans * tmp * comb(l * m + cnt, cnt) % mod
    cnt += l*m

print(ans)