#pragma region competitive_programming #ifdef __LOCAL #define _GLIBCXX_DEBUG #endif #pragma GCC optimize("Ofast") #include //#include "modint_plus.hpp" //typedef atcoder::modint1000000007 mint; //typedef atcoder::modint998244353 mint; //#include //#include "Formal_Power_Series.hpp" //typedef tomo0608::Formal_Power_Series fps; namespace tomo0608 { typedef long long ll; typedef long double ld; template using V = std::vector; template using VV = V>; template using VVV = V>; typedef std::pair pii; typedef std::pair pll; templatevoid input(T&... a) { (std::cin >> ... >> a); }; #define INT(...) int __VA_ARGS__; IN(__VA_ARGS__) #define LL(...) long long __VA_ARGS__; IN(__VA_ARGS__) #define CHAR(...) char __VA_ARGS__; IN(__VA_ARGS__) #define STR(...) string __VA_ARGS__; IN(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; IN(__VA_ARGS__) #define VEC(type, name, size) std::vector name(size);IN(name) #define VECVEC(type, name, h, w) std::vector> name(h, std::vector(w));IN(name) template std::istream& operator>>(std::istream& is, std::pair& p) { is >> p.first >> p.second; return is; } template std::ostream& operator<<(std::ostream& os, const std::pair& p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template std::istream& operator>>(std::istream& is, std::vector& v) { for (auto& e : v) is >> e; return is; } template std::ostream& operator<<(std::ostream& os, const std::vector& v) { for (auto& e : v) os << e << ' '; return os; } template std::ostream& operator << (std::ostream& os, std::set& set_var) { os << "{"; for (auto itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr;++itr;if (itr != set_var.end()) os << ", ";itr--; }os << "}";return os; } template std::ostream& operator<<(std::ostream& os, std::map& map_var) { os << "{";for (auto itr = map_var.begin(); itr != map_var.end(); itr++) { os << *itr;itr++;if (itr != map_var.end()) os << ", ";itr--; }os << "}";return os; } template void print_tuple(std::ostream&, const T&) {} template void print_tuple(std::ostream& os, const T& t) { if (i){os << ", ";} os << std::get(t); print_tuple(os, t); } template std::ostream& operator<<(std::ostream& os, const std::tuple& t) { os << "{"; print_tuple<0, std::tuple, Args...>(os, t); return os << "}"; } void IN() {} template void IN(Head& head, Tail &...tail) { std::cin >> head; IN(tail...); } void print() { std::cout << '\n'; } templatevoid print(const T& a, const Ts&... b) { std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout << '\n'; } void drop() { std::cout << '\n';exit(0); } templatevoid drop(const T& a, const Ts&... b) { std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout << '\n';exit(0); } #ifdef __LOCAL void debug_out() { std::cerr << std::endl; } template < class Head, class... Tail> void debug_out(Head H, Tail... T) { std::cerr << ' ' << H; debug_out(T...); } #define debug(...) std::cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) std::cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << std::endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif #define rep1(a) for(long long i = 0; i < (a); i++) #define rep2(i, a) for(long long i = 0; i < (a); i++) #define rep3(i, a, b) for(long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for(long long i = (a); i < (b); i += (c)) #define drep1(a) for(long long i = (a)-1; i >= 0; i--) #define drep2(i, a) for(long long i = (a)-1; i >= 0; i--) #define drep3(i, a, b) for(long long i = (a)-1; i >= (b); i--) #define drep4(i, a, b, c) for(long long i = (a)-1; i >= (b); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define drep(...) overload4(__VA_ARGS__, drep4, drep3, drep2, drep1)(__VA_ARGS__) #define endl '\n' struct io_setup { io_setup() { std::cin.tie(0); std::ios_base::sync_with_stdio(false); std::cout << std::setprecision(20); } }io_setup; } // namespace tomo0608 namespace tomo0608 { #define ALL(x) x.begin(),x.end() template T SUM(const S& v) { return accumulate(ALL(v), T(0)); } #define MIN(v) *min_element(ALL(v)) #define MAX(v) *max_element(ALL(v)) #define SORT(v) sort(ALL(v)) #define REVERSE(v) reverse(ALL(v)) #define RSORT(v) sort(ALL(v)); reverse(ALL(v)) #define UNIQUE(x) SORT(x), x.erase(unique(ALL(x)), x.end()) #define lb(c, x) distance((c).begin(), lower_bound(ALL(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(ALL(c), (x))) template void zip(std::vector& x) { std::vector y = x;UNIQUE(y);for (int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); } } template using priority_queue_rev = std::priority_queue, std::greater>; template inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return 1; } return 0; } template inline int count_between(std::vector& a, T l, T r) { return lower_bound(ALL(a), r) - lower_bound(ALL(a), l); } // [l, r) template int bittest(T n, int k) { return (n >> k) & 1; } int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); } int lowbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); } #define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(ALL(v)));) template T ceil(T x, S y) { assert(y); return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y)); } template T floor(T x, S y) { assert(y); return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1))); } template std::vector id_sort(const std::vector& v, bool greater = false) { int n = v.size(); std::vector ret(n); std::iota(ALL(ret), 0); std::sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } struct Random_Number_Generator { std::mt19937_64 mt; Random_Number_Generator() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {} // 区間 [l,r) の整数で乱数発生 int64_t operator()(int64_t l, int64_t r) { std::uniform_int_distribution dist(l, r - 1); return dist(mt); } // 区間 [0,r) の整数で乱数発生 int64_t operator()(int64_t r) { return (*this)(0, r); } } rng; struct Timer { std::chrono::system_clock::time_point start_time; Timer() { reset(); } void reset() { start_time = std::chrono::system_clock::now(); } int get_time() { std::chrono::system_clock::time_point now_time = std::chrono::system_clock::now(); return std::chrono::duration_cast(now_time - start_time).count(); } } timer; } //using namespace atcoder; using namespace std; using namespace tomo0608; int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }; int dy[8] = { 0, 1, 0, -1, 1, -1, -1, 1 }; // インタラクティブ問題のときは出力するたびにcout.flush();を忘れない!!!!! void solve(); int main() { int codeforces = 1; //cin >> codeforces; while (codeforces--) { solve(); } return 0; } #pragma endregion void solve() { INT(n); STR(st); map mp; for(auto x:"ABCEDEFGHIJKLMNOPQRSTUVWXYZ")mp[x] = 0; for(auto x: st)mp[x]++; string ans; for(auto [x, num]:mp){ debug(x,num); ans += to_string(num); } print(ans.substr(1, ans.size()-1)); }