#if !__INCLUDE_LEVEL__
#include __FILE__

// using mint = modint998244353;
// using mint = modint1000000007;

void solve(){
    int N; cin>>N;
    int X[26]={0};
    rep(i,0,N){
        char c; cin>>c;
        X[c-'A']++;
    }
    for(auto&& c:X)cout<<c;
}

#else


#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i,l,r) for(int i=(l);i<(r);++i)
#define rrep(i,l,r) for(int i=(r)-1;i>=(l);--i)
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long,long long>;
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)x.size())
#define pqueue priority_queue
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define inr(l, x, r) (l <= x && x < r)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define popcount __builtin_popcount
#define UNIQUE(v) sort(v.begin(),v.end()),v.erase(unique(v.begin(),v.end()),v.end());
void yn(bool flag){if(flag)cout<<"Yes"<<'\n'; else cout<<"No"<<'\n';}
template <typename T>
bool chmax(T &a,const T& b){if(a<b){a=b;return true;}return false;}
template <typename T>
bool chmin(T &a,const T& b){if(a>b){a=b;return true;}return false;}
void solve();

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(10);
    solve();
}

#endif