#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <vector>
#include <string>
 
using namespace std;
 
const int N = 1000;

string s, special;
int n, ans, c1, c2, c3, c4;
 
int main(){
 
  //freopen("a.in", "r", stdin);

  cin >> n;

  cin >> s;

  special = "!@#$%^&*()-+";

  for (int i = 0; i < s.size(); i++) {
    if (s[i] >= '0' && s[i] <= '9')
      c1 = 1;
    if (s[i] >= 'A' && s[i] <= 'Z')
      c2 = 1;
    if (s[i] >= 'a' && s[i] <= 'z')
      c3 = 1;
  }

  for (int i = 0; i < special.size(); i++) {
    for (int j = 0; j < s.size(); j++) {
      if (s[j] == special[i])
        c4 = 1;
    }
  }


  if (!c1)
    s += '0', ans++;
  if (!c2)
    s += 'A', ans++;
  if (!c3)
    s += 'a', ans++;
  if (!c4)
    s += '!', ans++;

  if ((int)s.size() < 6)
    ans += 6 - (int)s.size();

  cout << ans;
 
  return 0;
 
}