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


int main() {
    int n;
    cin >>n;
    string s;
    cin >>s;
    string numbers = "0123456789";
    string lower_case = "abcdefghijklmnopqrstuvwxyz";
    string upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    string special_characters = "!@#$%^&*()-+";
    bool isNum = false;
    bool isLo = false;
    bool isUp = false;
    bool isSp = false;
    for(auto& x : s){
        if(numbers.find(x)  != string::npos){
            isNum = true;
        }
        else if(lower_case.find(x)  != string::npos){
            isLo = true;
        }
        else if(upper_case.find(x)  != string::npos){
            isUp = true;
        }
        else if(special_characters.find(x)  != string::npos){
            isSp = true;
        }
    }
    int res = 0;
    if(!isNum){
        res += 1;
    }
    if(!isLo){
        res += 1;
    }
    if(!isUp){
        res += 1;
    }
    if(!isSp){
        res += 1;
    }
    if(n + res < 6){
        res += ( 6 - (n+res));
    }
    cout << res;
    return 0;
}