MOD = 998244353

def f(S):
    if S == "?":
        return -1
    else:
        return ord(S) - 97

n = int(input())
S = input()

if n == 1:
    if S == "?":
        print(26)
    else:
        print(1)
    exit()

S = list(map(f, S))
dp = [0] * (26 * 26)

if S[0] == -1:
    l1 = list(range(26))
else:
    l1 = [S[0]]

if S[1] == -1:
    l2 = list(range(26))
else:
    l2 = [S[1]]

for i in l1:
    for j in l2:
        if i != j:
            dp[i * 26 + j] = 1

for s in S[2:]:
    ndp = [0] * (26 * 26)
    cum = [0] * 26
    for i in range(26):
        for j in range(26):
            cum[j] += dp[26 * i + j]
    if s != -1:
        for i in range(26):
            for j in range(26):
                if i == j:
                    continue
                if s != -1:
                    if s != i and s != j:
                        ndp[26 * j + s] += dp[26 * i + j]
                        ndp[26 * j + s] %= MOD
    else:
        for j in range(26):
            for k in range(26):
                if j != k:
                    ndp[26 * j + k] += cum[j] - dp[26 * k + j]
                    ndp[26 * j + k] %= MOD
                

                    

    dp = ndp

print(sum(dp) % MOD)