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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    string arr;
    cin>>n>>arr;
    set<char> sp={'!','@','#','$','%','^','&','*','(',')','-','+'};
    bool has_dig=false;
    bool has_up=false;
    bool has_lo=false;
    bool has_sp=false;
    for(int i=0;i<arr.length();i++){
        if(int(arr[i]-'0')>=0 && (int(arr[i]-'0')<=9))
            has_dig=true;
        else if(int(arr[i]-'a')>=0 && int(arr[i]-'a')<=26)
            has_lo=true;
        else if(int(arr[i]-'A')>=0 && int(arr[i]-'A')<=26)
            has_up=true;
        else if(sp.find(arr[i])!=sp.end())
            has_sp=true;
    }
    int ct=0;
    if(!has_dig)
        ct++;
    if(!has_lo)
        ct++;
    if(!has_up)
        ct++;
    if(!has_sp)
        ct++;
    if(ct+arr.length()<6)
    {
        ct+=(6-(arr.length()+ct));
    }
    cout<<ct;
    return 0;
}