#include <iostream>
#include <cstdio>
#include <algorithm>
#include <fstream>
#include <string.h>
#include <cctype>
#include <list>
#include <vector>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <limits.h>
#include <math.h>
#include <map>
#include <deque>
#include <queue>
#include <utility>
#include <set>
#define xfor(i,start,end) for(ll i=start;i<end;i++)
#define rfor(i,end,start) for(int i=end-1;i>=start;i--)
#define scan(x) scanf("%d",&x)
#define print(x) printf("%d ",x)
#define init(x) memset(x,0,sizeof(x))
#define pb push_back
#define pf pop_front
#define mp make_pair
#define f first
#define s second
#define ull unsigned long long
#define PI 3.141592654
typedef long long ll;
const ll INF=ll(1e18);
const int MOD=1e9+7;
using namespace std;


class CompareDist{
public:
    bool operator()(pair<int,int> n1,pair<int,int> n2){
        if(n1.second!=n2.second) return n1.second>n2.second;
        else return n1.f>n2.f;
    }
};

string numbers="0123456789";
string lower_case = "abcdefghijklmnopqrstuvwxyz",upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ",special_characters = "!@#$%^&*()-+";
int main(){
    std::ios_base::sync_with_stdio(false);
    //freopen("/Users/Rahul/Desktop/B-large-practice.in","r",stdin);
    int n;
    cin>>n;
    string s;
    cin>>s;
    int res=0;
    bool len=false,dig=false,lower=false,upper=false,special=false;
    if(n>=6)    len=true;
    for(int i=0;i<n;i++){
        if(s[i]-'a'>=0 and 'z'-s[i]>=0)    lower=true;
        if(s[i]-'A'>=0 and 'Z'-s[i]>=0)    upper=true;
        if(s[i]-'0'>=0 and '9'-s[i]>=0)    dig=true;
        for(int j=0;j<special_characters.length();j++){
            if(s[i]==special_characters[j]){
                special=true;
                break;
            }
        }
    }
    int count=0;
    if(!dig) count++;
    if(!lower) count++;
    if(!upper) count++;
    if(!special) count++;
    res+=count;
    n+=count;
    if(n<6)    res+=6-n;
    cout<<res<<endl;
    return 0;
}