#include<bits/stdc++.h>
using namespace std;
#define sc(a) scanf("%d",&a);
#define sc2(a,b) scanf("%d%d",&a,&b)
#define sc3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scl(a) scanf("%lld",&a)
#define scl2(a,b) scanf("%lld%lld",&a,&b)
#define scl3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define pi pair<int,int> 
#define pii pair<int ,pair<int,int>>
#define pf(a) printf("%d\n",a)
#define pfl(a) printf("%lld\n",a)
#define pf2(a,b) printf("%d %d\n",a,b)
#define pfl2(a,b) printf("%lld %lld\n",a)
#define ll long long int
#define pb push_back
#define mp make_pair
#define pfst(s) printf("%s\n",s)
#define mem(a,i) memset(a,i,sizeof(a))
#define fr(i,n) for(i=0;i<n;i++)
#define fre(i,n) for(i=0;i<=n;i++)
#define fra(i,a,n) for(i=a;i<n;i++)
#define frae(i,a,n) for(i=a;i<=n;i++)
#define MAX 1000000
#define mod 1000000007

int main()
{
int n;
sc(n);
char s[1000];
scanf("%s",s);

int len=strlen(s);
int sy=0,u=0,l=0,d=0,req=0,i,ans=0;
if(len<6)
  req=6-len;
for(i=0;i<len;i++)
{
        if(s[i]>=65 && s[i] <= 90)
           l++;
           
           if(s[i]>=97 && s[i]<=122)
             u++;
             
             if(s[i]=='1'||s[i]=='2'||s[i]=='3'||s[i]=='4'||s[i]=='5'||s[i]=='5'||s[i]=='7'||s[i]=='8'||s[i]=='9'||s[i]=='0')
               d++;
               
               if(s[i]=='!'||s[i]=='@'||s[i]=='#' || s[i]=='$'||s[i]=='%'||s[i]=='^'||s[i]=='*'||s[i]=='('||s[i]==')'||s[i]=='-'||s[i]=='+')
                sy++;

}

        if(l==0)
          ans++;//cout<<"l"<<ans<<endl;}
          if(u==0)
            ans++;//cout<<"u"<<ans<<endl;}
            if(d==0)
              ans++;//cout<<"d"<<ans<<endl;}
              if(sy==0)
                ans++;//cout<<"sy"<<ans<<endl;}
                
               // cout<<l<<" "<<u<<" "<<d<<" "<<sy<<endl;
                if(req>=ans)
                ans=ans+abs(req-ans);
               
                
                pf(ans);
                



return 0;
}