#include<iostream>
#include<cstdio>
#include<cstring>
#include<sstream>
#include<string>
#include<algorithm>
#include<cmath>
#include<climits>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>


using namespace std;


#define pb push_back
#define sf scanf
#define pf printf
#define clr(x,y) memset((x),(y),sizeof((x)))

#define LL long long
#define ch printf("Came Here!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n")
#define mx 1009


int main(){
	int i,j,n;
	char pass[mx];
	char spec[14]="!@#$%^&*()-+\0";
	int small=1,big=1,num=1,sp=1;
	sf("%d",&n);
	sf("%s",pass);
	char c;
	for(i=0;i<n;i++){
		c = pass[i];
		if(c>='A' && c<= 'Z')big=0;
		if(c>='a' && c<= 'z')small=0;
		if(c>='0' && c<= '9')num=0;
		for(j=0;j<12;j++){
			if(c==spec[j]){
				sp=0;
				break;
			}
		}
	}

    int need = big+small+num+sp;
    if( n+need < 6 ){
        int add = 6-n-need;
        pf("%d\n",need+add);
    }
    else{
		pf("%d\n",need);
    }

//	main();

    return 0;
}