/* 
    Name: Mohit Khare
    CSE - MNNIT Allahabad
    never give up!!
*/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define speed ios_base::sync_with_stdio(false);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
 
#define rep(i,n) for(int i=0;i<n;i++)
#define repr(i,a,b) for(int i=a;i<b;i++)
#define revr(i,a,b) for(int i=a;i>b;i--)
#define pr1(a) cout<<a<<endl;
#define pr2(a,b) cout<<a<<" "<<b<<endl;
 
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0}; 
#define PI 3.1415926535897932384626
#define mod 1000000007
 
const ll linf=99999999999999999ll;
const int maxn=1e5+100;
 
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }

int main()
{
    //freopen("input.in","r",stdin);
    //freopen("output.txt","w",stdout);
    speed
    int n;
    cin>>n;
    string s;
    string numbers = "0123456789";
    string lower_case = "abcdefghijklmnopqrstuvwxyz";
    string upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    string special_characters = "!@#$%^&*()-+";
    cin>>s;
    int l = s.length();
    int len = n,up = 0,low = 0,spec = 0,num = 0;
    int ans = 0;
    rep(j,n)
    {
        for(int i = 0;i < numbers.length();i++)
        {
            if(numbers[i] == s[j])
                num++;
        }
        rep(i,lower_case.length())
        {
            if(lower_case[i] == s[j])
                low++;
        }
        rep(i,upper_case.length())
        {
            if(upper_case[i] == s[j])
                up++;
        }
        rep(i,special_characters.length())
        {
            if(special_characters[i] == s[j])
                spec++;
        }
    }

    // cout<<num<<" "<<low<<" "<<up << " "<< spec<<endl;

    if(num == 0)
    { 
        ans++;
        n++;
    }
    if(low == 0) { 
        ans++;
        n++;
    }
    if(up == 0) { 
        ans++;
        n++;
    }
    if(spec == 0){ 
        ans++;
        n++;
    }

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

    cout<<ans<<endl;

    return 0;
}