#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    string s;
    cin >> n >> s;
    bool isLong=false,hasDig=false,hasSpChar=false,hasLowCase=false,hasUppCase=false;
    isLong = 6-n>0?false:true;
    for(int i=0;i<n;i++){
        if(isdigit(s[i]))
            hasDig=true;
        if(islower(s[i]))
            hasLowCase=true;
        if(isupper(s[i]))
            hasUppCase=true;
    }
    if(s.find_first_of("!@#$%^&*()-+")!=string::npos)
        hasSpChar=true;
    int ans=0;
    if(!hasDig) ans++;
    if(!hasSpChar) ans++;
    if(!hasLowCase) ans++;
    if(!hasUppCase) ans++;
    if(6-n>ans)
        cout << 6-n;
    else
        cout << ans;
    return 0;
}