//header files
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <vector>
#include <utility>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#include <functional>
// C Header Files
#include <cstdio>
#include <cctype>
#include <cmath>
#include <math.h>
#include <ctime>
#include <cstring>
#include <time.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
// header files end

#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mm(a,b) memset(a,b,sizeof(a))
#define pp pair<ll,ll>

using namespace std;



int main()
{    
	string numbers = "0123456789";
	string lower_case = "abcdefghijklmnopqrstuvwxyz";
 	string upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
	string special_characters = "!@#$%^&*()-+";
	string s;
	int sizeee;
	cin>>sizeee;
	cin>>s;

	int len = -1;

	bool n = 0, l = 0, u=0, s_c = 0;

	for(int i=0;i<s.size();i++)
	{
		for(int j=0;j<numbers.size();j++)if(s[i]==numbers[j])n=1;
		for(int j=0;j<lower_case.size();j++)if(s[i]==lower_case[j])l=1;
		for(int j=0;j<upper_case.size();j++)if(s[i]==upper_case[j])u=1;
		for(int j=0;j<special_characters.size();j++)if(s[i]==special_characters[j])s_c=1;
	}
	
	int ans = 0;
	int sz = s.size();

	//cout<<n<<" "<<l<<" "<<u<<" "<<s_c<<" "<<sz<<"\n";
	if(!n)
	{
		sz++;ans++;
	}
	if(!l)
	{
		sz++;ans++;	
	}
	if(!u)
	{
		sz++;ans++;
	}
	if(!s_c)
	{
		sz++;ans++;
	}

	if(sz<6){
		ans+=6-sz;
	}

	cout<<ans;
}