def solve(n,s):
    mod = 998244353
    a = [0] * (n + 1)
    for i in range(n):
        if s[i] == '?':
            a[i + 1] += 1
        a[i + 1] += a[i]
    A = [0] * (n + 1)

    for i in range(n + 1):
        A[i] = pow(10, a[i], mod)
    ans = 0
    now = 0
    for i in range(n + 1):
        ans += A[i] * now
        now += pow(A[i], mod - 2, mod)
    ans = (ans - (n + 1) * (n) * pow(2, mod - 2, mod)) * pow(3, mod - 2, mod)
    a = [0] * (n + 1)
    b = [0] * 3
    b[0] = 1
    for i in range(n):
        if s[i] == '?':
            b[0] += 1
            continue
        else: a[i + 1] += int(s[i])
        a[i + 1] += a[i]
        b[a[i + 1] % 3] += 1
    for i in range(3):
        ans += b[i] * (b[i] - 1) // 2
    ans %= mod
    return ans

n = int(input())
s = input()

print(solve(n, s))