#include <bits/stdc++.h>

using namespace std;

#define ll 			long long
#define up(i,j,n)		for (int i = j; i <= n; i++)
#define down(i,j,n)	for (int i = j; i >= n; i--)
#define cmax(a,b)		a = ((a) > (b) ? (a) : (b))
#define cmin(a,b)		a = ((a) < (b) ? (a) : (b))
#define cadd(a,b)		a = add (a, b)
#define cpop(a,b)		a = pop (a, b)
#define cmul(a,b)		a = mul (a, b)
#define pii			pair<int, int>
#define fi			first
#define se			second
#define SZ(x)		(int)x.size()
#define Auto(i,node)	for (int i = LINK[node]; i; i = e[i].next)

const int MAXN = 105;

int N, ans = 0;
char s[MAXN];
bool chk[105];
string spj = "!@#$%^&*()-+";

int main(){
	scanf("%d%s", &N, s + 1);
	up (i, 1, N) {
		if (s[i] >= '0' && s[i] <= '9') chk[0] = 1;
		if (s[i] >= 'a' && s[i] <= 'z') chk[1] = 1;
		if (s[i] >= 'A' && s[i] <= 'Z') chk[2] = 1;
		up (j, 0, spj.length() - 1) if (s[i] == spj[j]) {
			chk[3] = 1;
			break;
		}
	}
	up (i, 0, 3) if (!chk[i]) {
		ans++;
		N++;
	}
	while (N < 6) {
		ans++;
		N++;
	}
	cout << ans << endl;
	return 0;
}