#include using namespace std; #define rep(i,j,k) for(i=j; i=k; i--) #define tr(c,it) for(auto it = (c).begin(); it != (c).end(); it++) #define ZERO(a) memset(a,0,sizeof(a)) #define lastbit(x) (x&(-x)) #define pb push_back #define all(c) (c).begin(),(c).end() #define fin scan_int() #define pd(x) printf("%d",x) #define newl printf("\n") #define xx first #define yy second #define mod 1000000007 #define FIND(x,y) ((y).find((x))!=(y).end()) #define dbg(a) cerr << #a << endl; #define dbgv(vari) cerr << #vari<< " = "<< (vari) <> n) ) n = 0; #define mod 1000000007 typedef long long ll; typedef vector vi; typedef vector vs; typedef vector vvi; typedef pair psi; typedef pair pii; string inttostr(int str){stringstream stream;stream << str;return stream.str();} ll modexpo(ll a,ll b,ll n){ll d=1;while(b){if(b&1)d=(d*a)%n;b>>=1;a=(a*a)%n;}return d;} ll expo(ll a,ll b){ll d=1;while(b){if(b&1)d=d*a;b>>1;a=a*a;}return d;} inline ll gcd(ll a, ll b){return b?gcd(b,a%b):a;} inline ll lcm(ll a,ll b) {return (a*b)/gcd(a,b);} ll inv(ll a,ll m){return modexpo(a,m-2,m);} /*/////////////////////////////////////////////////////////////////////////*///////////////////////////// #define gc getchar_unlocked inline int scan_int() { int NR=0,sign=1; char c=gc(); while( c < 48 || c > 57 ){if(c=='-')sign=0; c=gc();} while(c>47 && c< 58) { NR = (NR << 3) + (NR << 1) + (c - 48); c=gc(); } return (sign?NR:(-NR));} inline void fast_out(int x){ register char buffor[35]; register int i=0; do{buffor[i++]=(x%10)+'0'; x/=10; } while(x); i--; while(i>=0) putchar(buffor[i--]); putchar('\n'); } ////////////////////////////////////////////////////////////////////////////////////////////////////////*/ string numbers = "0123456789"; string lower = "abcdefghijklmnopqrstuvwxyz"; string upper = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; string special = "!@#$%^&*()-+"; int main(){ int n=fin; string s; cin>>s; int i; int fn=0,fl=0,fu=0,fs=0; int j; rep(i,0,n) { rep(j,0,numbers.length()) { if(numbers[j] == s[i]) fn=1; } rep(j,0,lower.length()) { if(lower[j] == s[i]) fl=1; } rep(j,0,upper.length()) { if(upper[j] == s[i]) fu=1; } rep(j,0,special.length()) { if(special[j] == s[i]) fs=1; } } int ans=0; ans = 4 - (fn+fs+fl+fu); if(s.length()+ans < 6) { ans += 6-(s.length()+ans); cout<