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

bool is_num(char ch){
    return (ch >= '0' && ch <= '9');
}    

bool is_l(char ch){
    return (ch >= 'a' && ch <= 'z');
} 
  
bool is_U(char ch){
    return (ch >= 'A' && ch <= 'Z');
} 

bool is_sp(char ch){
    return (ch == '!' or ch == '@' or ch == '#' or ch == '$' or ch == '%' or ch == '^' or ch == '&' or ch == '*' or ch == '(' or ch == ')' or ch == '-' or ch == '+' );
} 

int main() {
    int N;
    cin >> N;
    vector<char> v(N);
    for(auto &it : v) cin >> it;
    
    bool n = 0;
    bool l = 0;
    bool U = 0;
    bool sp = 0;
    
    for(int i=0; i<N; ++i){
        if(is_num(v[i])) n = 1;
        else if(is_U(v[i])) U = 1;
        else if(is_l(v[i])) l = 1;
        else if(is_sp(v[i])) sp = 1;
    }
    
    if(n==1 and l==1 and U==1 and sp==1){
        cout << max(0, 6-N);
        return 0;
    }
    
    int req = 0;
    if(!n) ++req;
    if(!l) ++req;
    if(!U) ++req;
    if(!sp) ++req;
    //cout << req;
    if((req + N) >= 6) cout << req;
    else cout << max(6 - N, req);
    
    return 0;
}