#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    string s; cin >> s;
    vector<int> cnt(26);
    for (char c : s) {
        cnt[c-'A'] += 1;
    }
    for (int i = 0; i < 26; ++i) {
        cout << cnt[i];
    }
    cout << endl;
}