#include "bits/stdc++.h"
 
#define wsp                cin >> ws;
#define sp                 setprecision            
#define sn(n)              scanf("%lld",&n)
#define cn(n)              cin>>n
#define pr(n)              printf("%lld\n",n)
#define ff                 first
#define ss                 second
#define prn                cout<<endl
#define str(n)             scanf("%s",n)
#define pb                 push_back
#define len(n)             n.length()
#define forp(i,a,b)        for(int i=a;i<=b;i++)
#define rep(i,n)           for(ll i=0;i<n;i++)
#define forn(i,a,b)        for(ll i=a;i>=b;i--)
#define ren(i,n)           for(ll i=n-1;i>=0;i--)
#define LALIT              ios_base::sync_with_stdio(false);cin.tie(0)
#define tr(container, it)  for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define mem(n,m)           memset(n,m,sizeof(n))
#define mp                 make_pair
#define mod               1000000007                                                                             
 
using namespace std;
typedef unsigned long long int ull;
typedef long long int          ll;
typedef pair<int, int>         pii;
typedef pair<ll, int>          pli;
typedef pair<double, int>      pdi;
typedef pair<ll, ll>           pll;
typedef pair<double, double>   pdd;
 
const int  N = int(300000)+5;

ll t , n  , k  , cnt ,sum, x , y  , l1 , r1;

ll a[N] , b[N] , c[N] ;
int main()
{
	string s ,p="0123456789",q="abcdefghijklmnopqrstuvwxyz",r="ABCDEFGHIJKLMNOPQRSTUVWXYZ",l="!@#$%^&*()-+";
    cin >> n >> s ;
    x = 0 ;
    y = n ;
	//n = len(s) ;
	rep(i,n)
	{
	    rep(j,len(p))
		{
			if(s[i]==p[j])x=1;
			}	
	 } 
	 if(x==0)n++;
	  x = 0 ;
	rep(i,n)
	{
	    rep(j,len(q))
		{
			if(s[i]==q[j])x=1;
			}	
	 } 
	 if(x==0)n++;
	  x = 0 ;
	//n = len(s) ;
	rep(i,n)
	{
	    rep(j,len(r))
		{
			if(s[i]==r[j])x=1;
			}	
	 } 
	 if(x==0)n++;
	  x = 0 ;
	//n = len(s) ;
	rep(i,n)
	{
	    rep(j,len(l))
		{
			if(s[i]==l[j])x=1;
			}	
	 } 
	 if(x==0)n++;
	 if(n<6)n=6;
	 cout<<n-y;
	return 0;
}