/* ∧∧∩ ( ゚∀゚)/ キタ━━━━━━(゚∀゚)━━━━━━!!!! ⊂ ノ ゆっくり見てってね!!!!!!!! (つ ノ o (ノ \ ☆ | o (⌒ ⌒ヽ / ☆ \ (´⌒ ⌒ ⌒ヾ / ('⌒ ; ⌒ ::⌒ ) (´ ) ::: ) / ☆─ (´⌒;: ::⌒`) :; ) */ #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define rep(i, s, n) for(int i=s; i<n; i++) #define all(a) a.begin(), a.end() typedef long long ll; typedef long double ld; ld pi = 3.14159265358979; // bool型に対して"Yes", "No" を出力する bool printb(bool f) {if (f) cout << "Yes\n";else cout << "No\n";return f;} //vectorのcout,cin template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;} template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;} // 回文かどうかの判定 bool iskaibun(string s){ll k = s.size();rep(i,0,k/2){if(s[i]!=s[k-1-i]){return false;}}return true;} template<class T> void chmax(T& a, T b) { if (a < b) a = b; } template<class T> void chmin(T& a, T b) { if (a > b) a = b; } // 余りが正になるような割り方 ll floor(ll x, ll m) { ll r = (x % m + m) % m; return (x - r) / m; } #define mod 998244353 using mint = modint998244353; int op(int a, int b) {return max(a, b);} int e() {return 0;} int mapping(int f, int x) {return (f == 1e9 ? x : f);} int composition(int f, int g) {return (f == 1e9 ? g : f);} int id() {return 1e9;} signed main() { cin.tie(nullptr); cout << fixed << setprecision(10); ios::sync_with_stdio(false); int n; cin >> n; string s; cin >> s; vector<int> cnt(26, 0); rep(i, 0, n) cnt[s[i]-'A']++; rep(i, 0, 26) cout << cnt[i]; cout << endl; }