#include<stdio.h>
#include<sstream>
#include<iostream>

#include<math.h>
#include<algorithm>
#include<utility>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<assert.h>
#include<time.h>

#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>

#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

string numbers = "0123456789";
string lower_case = "abcdefghijklmnopqrstuvwxyz";
string upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string special_characters = "!@#$%^&*()-+";

bool isspe(char x){
	for(int i=0;i<special_characters.length();i++){
		if(x == special_characters[i]) return true;
	}
	return false;
}

int main(){
	int n;
	cin>>n; getchar();
	string s;
	getline(cin,s);
	int num = 1, lo = 1, up = 1, spe = 1;
	for(int i=0;i<n;i++){
		if(s[i] >= '0' && s[i] <= '9') num = 0;
		else if(s[i] >= 'a' && s[i] <= 'z') lo = 0;
		else if(s[i] >= 'A' && s[i] <= 'Z') up = 0;
		else if(isspe(s[i])) spe = 0;
	}
	printf("%d\n",max(6 - n,num + lo + up + spe));
	return 0;
}