#include <bits/stdc++.h>
using namespace std;

#define N 100007
#define mod 998244353
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)

char s[N];

int f[62][8], sum[62][8];

void add(int &x, int y) {x = (x + y >= mod ? x + y - mod : x + y);}

int trans(char c) {
	if (isdigit(c)) return c - '0';      // 0 - 9
	if (islower(c)) return c - 'a' + 10; // 10 - 35
	if (isupper(c)) return c - 'A' + 36; // 36 - 61
	return -1;
}

int main() {
	int n;
	scanf("%d", &n);
	scanf("%s", s + 1);
	if (strlen(s + 1) != n) puts("???");
	
	int x = trans(s[1]);
	if (x > 35) f[x][4] = 1;
	else if (x > 9) f[x][2] = f[x + 26][4] = 1;
	else if (x >= 0) f[x][1] = 1;
	else {
		rep(j, 0, 9) f[j][1] = 1;
		rep(j, 10, 35) f[j][2] = 1;
		rep(j, 36, 61) f[j][4] = 1;
	}
	rep(k, 1, 7) 
		rep(j, 0, 61) {
			sum[j][k] = (j ? sum[j - 1][k] : 0);
			add(sum[j][k], f[j][k]);
		}

	rep(i, 2, n) {
		auto dp = [&](int nw, int mask) {
			rep(k, 1, 7) {
				int tar = sum[61][k] + (nw ? sum[nw - 1][k] : 0) - sum[nw][k];
				if (tar < 0) tar += mod;
				if (tar >= mod) tar -= mod;
				add(f[nw][k | mask], tar); 
			}
		};
		memset(f, 0, sizeof(f));
		int x = trans(s[i]);
		if (x > 35) dp(x, 4);
		else if (x > 9) {dp(x, 2); dp(x + 26, 4);}
		else if (x >= 0) dp(x, 1);
		else {
			rep(j, 0, 9) dp(j, 1);
			rep(j, 10, 35) dp(j, 2);
			rep(j, 36, 61) dp(j, 4);
		}
		rep(k, 1, 7) 
			rep(j, 0, 61) {
				sum[j][k] = (j ? sum[j - 1][k] : 0);
				add(sum[j][k], f[j][k]);
			}
		bool fl = 0;
		rep(k, 1, 7) if (sum[61][k] > 0) fl = true;
		if (!fl) printf("%d\n", i);
	}
	printf("%d\n", sum[61][7]);
	return 0;
}

/*
aaaaaaaaA
*/