# while 1:
# a=list(map(int,input().split()))
# if a[0]==0 and a[1]==0 and a[2]==0:
# break
# a.sort()
# if a[0]*a[0]+a[1]*a[1]==a[2]*a[2]:
# print('right')
# else:
# print('wrong')
# n=int(input())
# a=list(map(int,input().split()))
# b=int(0)
# t,p=map(int,input().split())
# for i in range(6):
# if a[i]%t==0:
# b=b+a[i]//t
# else:
# b=b+a[i]//t+1
# print(b)
# print(n//p,n%p)
# def Isprime(n):
# if n==1:
# return 0
# for i in range(2,n):
# if n%i==0:
# return 0
# return 1
# n=int(input())
# m=int(0)
# a=list(map(int,input().split()))
# for i in range(n):
# if Isprime(a[i])==1:
# m=m+1
# print(m)
# n=int(input())
# ans=0
# a=[]
# for i in range(n):
# a=[int(j) for j in str(i)]
# if sum(a)+i==n:
# ans=i
# break
# print(ans)
# import math
# n=int(input())
# a=int(1)
# b=int(0)
# i=int(0)
# while 1:
# a=a+i*6
# if n==1:
# b=0
# break
# if a>=n:
# b=i
# break
# i=i+1
# print(b+1)
# def dfs(c,l):
# global n,m,a,b,ans
# if c==3:
# if m>=sum(b) and sum(b)>ans:
# ans=sum(b)
# return
# for i in range(l+1,n):
# b.append(a[i])
# dfs(c+1,i)
# b.pop()
# n,m=map(int,input().split())
# a=list(map(int,input().split()))
# b=[]
# ans=0
# dfs(0,-1)
# print(ans)
l=int(input())
s=input()
a=list(s)
n=int(0)
m=int(0)
for i in range(l):
m=ord(a[i])