#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools
mod=998244353

import sys
input=sys.stdin.readline

n = int(input())
s = input().rstrip()
dp = [[0] * 3 for _ in range(n+1)]
ans = 0
for i in range(n):
    if s[i] == '?':
        ans += 4
        ans += dp[i][0] * 4
        ans += dp[i][1] * 3
        ans += dp[i][2] * 3
        ans %= mod
        dp[i+1][0] = (dp[i][0] * 4 + dp[i][1] * 3 + dp[i][2] * 3 + 4) % mod
        dp[i+1][1] = (dp[i][0] * 3 + dp[i][1] * 4 + dp[i][2] * 3 + 3) % mod
        dp[i+1][2] = (dp[i][0] * 3 + dp[i][1] * 3 + dp[i][2] * 4 + 3) % mod
    else:
        si = int(s[i])
        if si % 3 == 0:
            ans += 1
            ans += dp[i][0]
            dp[i+1][0] += 1
            dp[i+1][0] += dp[i][0]
            dp[i+1][1] += dp[i][1]
            dp[i+1][2] += dp[i][2]
        elif si % 3 == 1:
            ans += dp[i][2]
            dp[i+1][1] += 1
            dp[i+1][0] += dp[i][2]
            dp[i+1][1] += dp[i][0]
            dp[i+1][2] += dp[i][1]
        else:
            ans += dp[i][1]
            dp[i+1][2] += 1
            dp[i+1][0] += dp[i][1]
            dp[i+1][1] += dp[i][2]
            dp[i+1][2] += dp[i][0]
        ans %= mod

print(ans)