#include <iostream>
#include<stdio.h>
#include<sstream>
#include<string>
#include<bits/stdc++.h>
#include<stdio.h>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<math.h>
#include<list>
#include<limits.h>
#include<algorithm>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) (find(all(container),element) != container.end())
#define all(c) c.begin(), c.end()
#define MOD 1000000007
#define MAX 10000
typedef long long ll;
using namespace std;
int main()
{
    long t,n,q,s=0,a,bc,d,bin, dec = 0, rem, num, base = 1,ans=0;
    string bs;
    cin>>n;
    cin>>bs;
    ll la=0,spe=0,dig=0;
    for(ll i=0;i<bs.size();i++){
        if(bs[i]>=97&&bs[i]<=122)s++;
        if(bs[i]>=65&&bs[i]<=90) la++;
        if(bs[i]>=48&&bs[i]<=57) dig++;
        if(bs[i]=='!'||bs[i]=='@'||bs[i]=='#'||bs[i]=='$'||bs[i]=='%'||bs[i]=='^'||bs[i]=='&'||bs[i]=='*'||bs[i]=='('||bs[i]==')'||bs[i]=='+'||bs[i]=='-') spe++;

    }
if(bs.size()>=6&&s>0&&la>0&&dig>0&&spe>0) cout<<0;
else {
    if(s==0) ans++;
    if(la==0) ans++;
    if(dig==0) ans++;
    if(spe==0) ans++;
    if(bs.size()+ans<6){ans+=6-bs.size()-ans;}

 cout<<ans;
}
    return 0;
}