#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
vector <ll> vec,vec2;
int main()
{
	ll t,n,i,j,k,l,m;
	string str;
	cin>>n;
	string str2="!@#$%^&*()-+";
	cin>>str;
	n=str.length();
	bool flag1=0,flag2=0,flag3=0,flag4=0;
	ll ans=0;
	for (i=0;i<n;i++)
	  {
	  	for (j=0;j<str2.length();j++)
	  	  if (str[i]==str2[j])
	  	    flag2=1;
	  	if (str[i]>='0' && str[i]<='9')
	  	  flag1=1;
	  	 if (str[i]>='a' && str[i]<='z')
	  	  flag3=1;
	  	 if (str[i]>='A' && str[i]<='Z')
	  	   flag4=1;
	  }
	  if (!flag1)
	   ans++;
	   if (!flag2)
	     ans++;
	     if (!flag3)
	       ans++;
	       if (!flag4)
	         ans++;
	         ans+=max(0ll,6-(n+ans));
	         cout<<ans<<'\n';

		 	
		 	
	
	return 0;
}