import sys
#sys.setrecursionlimit(10 ** 6)
#sys.set_int_max_str_digits(0)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    S = LC()
    Alpha = {}
    # 大文字
    for i in range(65, 91):
        Alpha[chr(i)] = i - 65
        Alpha[i - 65] = chr(i)
    Ans = [0]*26
    for s in S:
        Ans[Alpha[s]]+=1
    print(*Ans,sep="")
    return
solve()