// choices and belief 

#include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef priority_queue<pii, vector<pii>, greater<pii>> min_pq;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define whatis(x) cout << #x << " is " << x << endl;
#define inf 1e18



int check(char s)
{
	char c[] = {'!','@','#','$','%','^','&','*','(',')','-','+'};
	for(auto cc : c)
	{
		// cout<<cc<<endl;
		if(cc==s)return 1;
	}
	return 0;
}

int main()
{
	ios_base:: sync_with_stdio(false); cin.tie(0);
	// freopen ("inp","r",stdin);
	// freopen ("out","w",stdout);
	check('s');
	int n;
	cin>>n;
	string s;
	cin>>s;
	int q=1,w=1,e=1,r=1;
	for(int i=0;i<n;i++)
	{
		if(s[i]>='a' and s[i]<='z' )
			q=0;
		if(s[i]>='A' and s[i]<='Z' )
			w=0;
		if(s[i]>='0' and s[i]<='9' )
			e=0;
		if(check(s[i]))
			r=0;
	}
	int want = q+w+e+r;
	// cout<<want<<endl;
	if(want+n>=6)
		cout<<want<<endl;
	else
		cout<<want+(6-(want+n))<<endl;

	
	return 0;
}