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


int main() {
    int n;
    cin>>n;
    string s;
    cin>>s;
    if(s.length()<=3)cout<<6-s.length();
    else{
        int n1=0,k1=0,y1=0,z1=0;
      string n=  "0123456789";
        string k= "abcdefghijklmnopqrstuvwxyz";
        string y="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
        string z="!@#$%^&*()-+";
        for(int i=0;i<s.length();i++){
            if(n.find(s[i])!=string::npos)n1++;
            else if(k.find(s[i])!=string::npos)k1++;
            else if(y.find(s[i])!=string::npos)y1++;
            else if(z.find(s[i])!=string::npos)z1++;
        }
        int c=0;
      //  if(s.length()>=6){
            if(n1==0)c++;
            if(k1==0)c++;
            if(y1==0)c++; if(z1==0)c++;
        if(s.length()<6){
            if(c > 6-s.length())cout<<c;
            else cout<<6-s.length();
        }
      else cout<<c;
    }
    return 0;
}