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

#define N 100010
#define mod 1000000007

int mul(int a,int b){
	int res=(a*1LL*b)%mod;
	return res<0?res+mod:res;
}

int add(int a,int b){
	int res=(a+b)%mod;
	return res<0?res+mod:res;
}

int main(){
	string s;
	int n,a=0,b=0;
	bool dig=1,up=1,low=1,sp=1;
	
	cin>>n;
	cin>>s;
	
	a=max(0,6-n);
	for(int i=0;i<n;i++){
		if(s[i] <= '9' && s[i]>='0')
			dig=0;
		else if(islower(s[i]))
			low=0;
		else if(isupper(s[i]))
			up=0;
		else if(s[i]=='!' || s[i]=='@' || s[i]=='#' || s[i]=='$' || s[i]=='%' || s[i]=='^' || s[i]=='&' || s[i]=='*' || s[i]=='(' || s[i]==')' || s[i]=='-' || s[i]=='+')
			sp=0;
	}
	b=dig+up+low+sp;
	cout<<max(a,b);
	return 0;
}