#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <utility>
#include <map>
#include <vector>
#include <climits>
#include <set>
#include <algorithm>
 
using namespace std;

int main(){
	int n;
	scanf("%d", &n);

    string s;
    cin >> s;
    string sp = "!@#$%^&*()-+";
    
    int ans = 0;
    bool fg = 0;   
    for(int i = 0; i <= 9; i++)
        if(s.find('0' + i) != string::npos){
            fg = 1;
            break;
        }
    
    if(fg == 0)
        ans += 1;
    
    fg = 0;
    
    for(int i = 0; i < 26; i++){
        if(s.find('a' + i) != string::npos){
            fg = 1;
            break;
        }
    }
    
    if(fg == 0)
        ans += 1;
    
        fg = 0;
    
    for(int i = 0; i < 26; i++){
        if(s.find('A' + i) != string::npos){
            fg = 1;
            break;
        }
    }
    
    if(fg == 0)
        ans += 1;
    
        fg = 0;
    
    for(int i = 0; i < sp.size(); i++){
        if(s.find(sp[i]) != string::npos){
            fg = 1;
            break;
        }
    }
    
    if(fg == 0)
        ans += 1;
    
    if(s.size() + ans < 6)
        ans = 6 - s.size();
    
    cout << ans << endl;
	return 0;
}