/*
Pradyumn Sinha 
Delhi Technological University
*/
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> OST;
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii >
#define vll vector<pll>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pi 3.14159265358979
#define EL printf("\n")
#define OK printf("OK");
#define foreach(i,t) for(auto i =t.begin();i!=t.end();i++) 
#define pdn(n) printf("%d\n",n)
#define pln(n) printf("%lld\n",n)
#define psn(n) printf("%s\n",n)
#define pcn(n) printf("%c\n",n)
#define sl(n) scanf("%lld",&n)
#define sd(n) scanf("%d",&n)
#define ss(n) scanf("%s",&n)
#define pn printf("\n")
#define SZ(x) ((int)(x.size()))
#define PI 3.14159265
#define inf 1e18
#define mod 1000000007
#define precise(n,k) fixed<<setprecision(k)<<n
#define DBG(c) cout << #c << " = " << c << endl;
#define RTIME ((double)clock()/(double)CLOCKS_PER_SEC)
#define fequal(a,b) (fabs(a - b)<(1e-9))
int toint(const string &s) { stringstream ss; ss << s; int x; ss >> x; return x; }
string tostring ( int number ){  stringstream ss; ss<< number; return ss.str();}

typedef long long ll;
typedef long double lf;

ll pw(ll a,ll b) 
{if(b==0) return 1; if(b==1) return a;  ll ans=pw(a,b/2); if(b&1) 
return (((ans*ans)%mod*a)%mod); 
 return (ans*ans)%mod; }	


ll const NMAX=2e5+20;

string numbers = "0123456789";
string lower_case = "abcdefghijklmnopqrstuvwxyz";
string upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string special_characters = "!@#$%^&*()-+";
map<char,int> sp;
	int mark[4];
int main()
{
	for(auto ch:special_characters)
		sp[ch]=1;
	int n;
	sd(n);
	string s;
	cin>>s;

	for(auto ch:s)
	{
		if(ch>='0'&&ch<='9')
			mark[0]=1;
		else if(ch>='a'&&ch<='z')
			mark[1]=1;

		else if(ch>='A'&&ch<='Z')
			mark[2]=1;

		else if(sp[ch]==1)
			mark[3]=1;
	}

	int cnt=4;
	for(int i=0;i<4;i++)
		cnt-=mark[i];
	cnt=max(cnt,max(0,6-n));
	pdn(cnt);
	return 0;
}