#include<bits/stdc++.h>

using namespace std;

#define endl "\n"

typedef long long ll;

const int N = 1e5 + 100;

ll dp[2][62][8];

ll P = 998244353;

int cl(int n)
{
	if (n < 10)
	{
		return 1;
	}
	if (n < 36)
	{
		return 2;
	}
	return 4;
}

int main()
{
	int n;
	cin >> n;
	string s;
	cin >> s;
	s = ' ' + s;
	if (s[1] >= '0' && s[1] <= '9')
	{
		int j = s[1] - '0';
		dp[1][j][1] = 1;
	}
	else if (s[1] >= 'A' && s[1] <= 'Z')
	{
		int j = s[1] - 'A' + 10;
		dp[1][j][2] = 1;
	}
	else if (s[1] >= 'a' && s[1] <= 'z')
	{
		int j = s[1] - 'a' + 10;
		dp[1][j][2] = 1;
		j = s[1] - 'a' + 10 + 26;
		dp[1][j][4] = 1;
	}
	else
	{
		for (int j = 0; j < 62; j++)
		{
			dp[1][j][cl(j)] = 1;
		}
	}
	for (int i = 2; i <= n; i++)
	{
		int id = i % 2;
		if (s[i] >= '0' && s[i] <= '9')
		{
			int j = s[i]-'0';
			for (int k = 0; k < 62; k++)
			{
				if (k == j)
				{
					continue;
				}
				for (int l = 0; l < (1 << 3); l++)
				{
					(dp[id][j][l | cl(j)] += dp[id^1][k][l])%=P;
				}
			}
		}
		else if (s[i] >= 'A' && s[i] <= 'Z')
		{
			int j = s[i] - 'A'+10;
			for (int k = 0; k < 62; k++)
			{
				if (k == j)
				{
					continue;
				}
				for (int l = 0; l < (1 << 3); l++)
				{
					(dp[id][j][l | cl(j)] += dp[id^1][k][l])%=P;
				}
			}
		}
		else if (s[i] >= 'a' && s[i] <= 'z')
		{
			int j = s[i] - 'a' + 10;
			for (int k = 0; k < 62; k++)
			{
				if (k == j)
				{
					continue;
				}
				for (int l = 0; l < (1 << 3); l++)
				{
					(dp[id][j][l | cl(j)] += dp[id^1][k][l])%=P;
				}
			}
			j = s[i] - 'a' + 10+26;
			for (int k = 0; k < 62; k++)
			{
				if (k == j)
				{
					continue;
				}
				for (int l = 0; l < (1 << 3); l++)
				{
					(dp[id][j][l | cl(j)] += dp[id^1][k][l])%=P;
				}
			}
		}
		else
		{
			vector <ll>su(8,0);
			for (int k = 0; k < 62; k++)
			{
				for (int l = 0; l < (1 << 3); l++)
				{
					(su[l] += dp[id^1][k][l])%=P;
				}
			}
			for (int j = 0; j < 62; j++)
			{
				int k = j;
				for (int l = 0; l < (1 << 3); l++)
				{
					(dp[id][j][l | cl(j)] += su[l])%=P;
					(dp[id][j][l | cl(j)] += P - dp[id^1][k][l])%=P;
				}
			}
		}
		for (int j = 0; j < 62; j++)
		{
			for (int l = 0; l < (1 << 3); l++)
			{
				dp[id ^ 1][j][l] = 0;
			}
		}
	}
	ll an = 0;
	for (int j = 0; j < 62; j++)
	{
		(an += dp[n%2][j][7])%=P;
	}
	cout << an << endl;
	return 0;
}