#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db; 


const int mod = 998244353;
void updAdd(int& a, int b)
{
	a += b;
	if(a >= mod)
		a -= mod;
}
int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}


int dp[2][2][2][2][63];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	dp[0][0][0][0][62] = 1;
	
	FOR(i, 0, n)
	{
		char x;
		cin >> x;
		int id;
		if('a' <= x && x <= 'z')
			id = x - 'a';
		else if('A' <= x && x <= 'Z')
			id = (x - 'A') + 26;
		else if('0' <= x && x <= '9')
			id = (x - '0') + 52;
		else
			id = 62;
		
		int t = i % 2;
		
		FOR(hasU, 0, 2)
		FOR(hasL, 0, 2)
		FOR(hasD, 0, 2)
		FOR(val, 0, 63)
			dp[t ^ 1][hasU][hasL][hasD][val] = 0;
		
		FOR(hasU, 0, 2)
		FOR(hasL, 0, 2)
		FOR(hasD, 0, 2)
		{
			auto& DP = dp[t][hasU][hasL][hasD];
			int sum = 0;
			FOR(val, 0, 63)
				updAdd(sum, DP[val]);
			
			if(id < 26)
			{
				updAdd(dp[t ^ 1][hasU][1][hasD][id], sub(sum, DP[id]));
				updAdd(dp[t ^ 1][1][hasL][hasD][id + 26], sub(sum, DP[id + 26]));
			}
			else if(id < 52)
			{
				updAdd(dp[t ^ 1][1][hasL][hasD][id], sub(sum, DP[id]));		
			}
			else if(id < 62)
			{
				updAdd(dp[t ^ 1][hasU][hasL][1][id], sub(sum, DP[id]));		
			}
			else
			{
				FOR(val, 0, 26)
					updAdd(dp[t ^ 1][hasU][1][hasD][val], sub(sum, DP[val]));
				FOR(val, 26, 52)
					updAdd(dp[t ^ 1][1][hasL][hasD][val], sub(sum, DP[val]));
				FOR(val, 52, 62)
					updAdd(dp[t ^ 1][hasU][hasL][1][val], sub(sum, DP[val]));
			}
		}
	}
	int ans = 0;
	FOR(val, 0, 62)
		updAdd(ans, dp[n % 2][1][1][1][val]);
	cout << ans << "\n";
	



	
	return 0;
}