#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <limits.h>
#include <string>
#include <string.h>
#include <stdio.h>
#include <set>
#include <map>
#include <queue>

using namespace std;

#define first FF
#define second SS
#define all(v) v.begin(),v.end()

typedef long long int intl;
typedef pair<int,int> pii;

bool isSpecial(char ch)
{
	switch(ch)
	{
		case '!':
		case '@':
		case '#':
		case '$':
		case '%':
		case '^':
		case '&':
		case '*':
		case '(':
		case ')':
		case '-':
		case '+':return true;
		break;
		default: return false;

	}
}
int main()
{
// 	string numbers = "0123456789"
// lower_case = "abcdefghijklmnopqrstuvwxyz"
// upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
// special_characters = "!@#$%^&*()-+"	
	int n;
	cin>>n;
	char str[n+1];
	for(int i=0;i<n;i++)
	{
		cin>>str[i];
	}
	int digit=0,lower=0,upper=0,special=0;
	for(int i=0;i<n;i++)
	{
		if(digit==0 && str[i]>='0' && str[i]<='9')
		{
			digit = 1;
		}	
		else if(lower==0 && str[i]>='a' && str[i]<='z')
		{
			lower=1;
		}
		else if(upper==0 && str[i]>='A'&&str[i]<='Z')
		{
			upper=1;
		}
		else if(special==0 && isSpecial(str[i]))
		{
			special=1;
		}
	}
	int count=4;
	if(digit==1)
		count--;
	if(lower==1)
		count--;
	if(upper==1)
		count--;
	if(special==1)
		count--;
	if(n>=6)
		cout<<count;
	else if((6-n)>count)
	{	
		cout<<(6-n);
	}
	else 
		cout<<count;
	return 0;
}