import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    /*
    HashSet<Character> hs = new HashSet<Character>();
    hs.add('!');
    hs.add('@');
    hs.add('#');
    hs.add('$');
    hs.add('%');
    hs.add('^');
    hs.add('&');
    hs.add('*');
    hs.add('(');
    hs.add(')');
    hs.add('-');
    hs.add('+');
    */
    

    static int minimumNumber(int n, String password) {
        // Return the minimum number of characters to make the password strong
        int count = 0;
        boolean flag1 = false, flag2 = false,flag3 = false,flag4 = false;
        for(char c:password.toCharArray()){
            if(!flag4){
                if(c == '!' || c == '@' || c == '#' || c == '$' || c == '%' || c == '^' || c == '&' || c =='*' || c == '('
                  || c == ')' || c == '-' || c == '+')
                    flag4 = true;
            }
            if(!flag1 && Character.isDigit(c))
                flag1 = true;
            if(!flag2 && Character.isLowerCase(c))
                flag2 = true;
            if(!flag3 && Character.isUpperCase(c))
                flag3 = true;
            if(flag1 && flag2 && flag3 && flag4)
                break;
        }
        if(!flag1){
            count++;
            n++;
        }
        if(!flag2){
            count++;
            n++;
        }
        if(!flag3){
            count++;
            n++;
        }
        if(!flag4){
            count++;
            n++;
        }
        if(n < 6){
            count += (6 - n);
        }
        
        return count;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        String password = in.next();
        int answer = minimumNumber(n, password);
        System.out.println(answer);
        in.close();
    }
}