#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define clr(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector< int > vi;
typedef vector< ll > vl;
typedef vector< pii > vpii;
typedef vector< pll > vpll;

const int MOD = 1e9+7;

ll power(ll a, ll b) {ll ret=1;while(b) {if(b&1) ret*=a;a*=a;if(ret>=MOD) ret%=MOD;if(a>=MOD)a%=MOD;b>>=1;}return ret;}
ll inv(ll x) {return power(x,MOD-2);}

const int N = 1e5+5;

string a = "0123456789";
string b = "abcdefghijklmnopqrstuvwxyz";
string c = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string d = "!@#$%^&*()-+";
string s;
int n, na, nb, nc, nd, ans;

int main() {
	// freopen("Task.in","r",stdin);freopen("Task.out","w",stdout);
	std::ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin>>n>>s;
	for(int i=0 ; i<n ; i++) {
		if(s[i]>='0' && s[i]<='9') na = 1;
		if(s[i]>='a' && s[i]<='z') nb = 1;
		if(s[i]>='A' && s[i]<='Z') nc = 1;
		for(int j=0 ; j<sz(d) ; j++) {
			if(s[i]==d[j]) nd = 1;
		}
	}
	ans = 4-(na+nb+nc+nd);
	if(n+ans<6) ans += (6-(ans+n));
	cout<<ans;
}