#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
int mod = 998244353;
const int N = 100010;
int n;
int dp[2][110][10];
int sum[70][10], a[N], ty[N];
int op[10];
int into(char k)
{
    if (k >= '0' && k <= '9')
        return 0;
    if (k >= 'A' && k <= 'Z')
        return 1;
    if (k >= 'a' && k <= 'z')
        return 2;
    return 3;
}
int get(char k)
{
    if (k >= '0' && k <= '9')
        return k - '0';
    if (k >= 'A' && k <= 'Z')
        return k - 'A' + 10;
    if (k >= 'a' && k <= 'z')
        return k - 'a' + 36;
    return 63;
}
int getmod(int x)
{
    if (x < 0)
    {
        x += mod;
    }
    if (x >= mod)
    {
        x -= mod;
    }
    return x;
}
void solve()
{
    cin >> n;
    string s;
    cin >> s;
    // scanf("%s", s + 1);
    s = ' ' + s;
    //  cout << get('Z') << endl;
    for (int i = 1; i <= n; i++)
    {
        a[i] = get(s[i]);
        ty[i] = into(s[i]);
    }
    int now = 0;
    if (ty[1] <= 2)
    {
        dp[0][a[1]][0 | (1 << ty[1])] = 1;
        if (ty[1] == 2)
        {
            dp[0][a[1] - 26][0 | 2] = 1;
        }
    }
    if (ty[1] == 3)
    {
        for (int r = 0; r <= 9; r++)
        {
            dp[0][r][1] = 1;
        }
        for (int r = 10; r <= 35; r++)
        {
            dp[0][r][2] = 1;
        }
        for (int r = 36; r <= 61; r++)
        {
            dp[0][r][4] = 1;
        }
    }
    for (int i = 2; i <= n; i++)
    {
        int t = now ^ 1;
        if (ty[i] <= 1)
        {
            for (int k = 0; k < 8; k++)
            {
                for (int j = 0; j <= 61; j++)
                {
                    if (a[i] == j)
                        continue;
                    dp[t][a[i]][k | (1 << ty[i])] += dp[now][j][k];
                    dp[t][a[i]][k | (1 << ty[i])] = getmod(dp[t][a[i]][k | (1 << ty[i])]);
                }
            }
        }
        if (ty[i] == 2)
        {
            for (int k = 0; k < 8; k++)
            {
                for (int j = 0; j <= 61; j++)
                {
                    if (a[i] != j)
                    {
                        dp[t][a[i]][k | (1 << ty[i])] += dp[now][j][k];
                        dp[t][a[i]][k | (1 << ty[i])] = getmod(dp[t][a[i]][k | (1 << ty[i])]);
                    }
                    if (a[i] - 26 != j)
                    {
                        dp[t][a[i] - 26][k | 2] += dp[now][j][k];
                        dp[t][a[i] - 26][k | 2] = getmod(dp[t][a[i] - 26][k | 2]);
                    }
                }
            }
            /*for (int k = 0; k < 8; k++)
            {
                for (int j = 0; j <= 61; j++)
                {
                    if (a[i] - 26 == j)
                        continue;
                    dp[t][a[i] - 26][k | 2] += dp[now][j][k];
                    dp[t][a[i] - 26][k | 2] = getmod(dp[t][a[i] - 26][k | 2]);
                }
            }*/
        }
        if (ty[i] == 3)
        {
            for (int j = 0; j < 8; j++)
                op[j] = 0;
            for (int k = 0; k < 8; k++)
            {
                for (int j = 0; j <= 61; j++)
                {
                    op[k] += dp[now][j][k];
                    op[k] = getmod(op[k]);
                }
            }

            for (int k = 0; k < 8; k++)
            {
                for (int j = 0; j <= 61; j++)
                {
                    sum[j][k] = op[k];
                    sum[j][k] -= dp[now][j][k];
                    sum[j][k] = getmod(sum[j][k]);
                }
            }
            for (int j = 0; j <= 61; j++)
            {
                for (int k = 0; k < 8; k++)
                {
                    if (j >= 0 && j <= 9)
                        dp[t][j][k | 1] += sum[j][k], dp[t][j][k | 1] = getmod(dp[t][j][k | 1]);
                    if (j >= 10 && j <= 35)
                        dp[t][j][k | 2] += sum[j][k], dp[t][j][k | 2] = getmod(dp[t][j][k | 2]);
                    if (j >= 36 && j <= 61)
                        dp[t][j][k | 4] += sum[j][k], dp[t][j][k | 4] = getmod(dp[t][j][k | 4]);
                    /*for (int r = 0; r <= 9; r++)
                    {
                        if (r == j)
                            continue;
                        dp[t][r][k | 1] += dp[now][j][k];
                        dp[t][r][k | 1] = getmod(dp[t][r][k | 1]);
                    }
                    for (int r = 10; r <= 35; r++)
                    {
                        if (r == j)
                            continue;
                        dp[t][r][k | 2] += dp[now][j][k];
                        dp[t][r][k | 2] = getmod(dp[t][r][k | 2]);
                    }
                    for (int r = 36; r <= 61; r++)
                    {
                        if (r == j)
                            continue;
                        dp[t][r][k | 4] += dp[now][j][k];
                        dp[t][r][k | 4] = getmod(dp[t][r][k | 4]);
                    }*/
                }
            }
        }
        for (int j = 0; j < 8; j++)
        {
            for (int r = 0; r <= 62; r++)
            {
                dp[now][r][j] = 0;
            }
        }
        now = t;
    }
    int res = 0;
    for (int i = 0; i <= 61; i++)
    {
        res += dp[now][i][7];
        res = getmod(res);
    }
    cout << getmod(res) << endl;
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}