import sys

sys.set_int_max_str_digits(1000005)
# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 18446744073709551615
# inf = 4294967295
# md = 10**9+7
md = 998244353

# aけたまでの整数を並べたときの長さ
def length(a):
    res = b**a*a-(b**a-1)//(b-1)
    return res

def binary_search(l, r, ok, minimize):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l

def digit(a, i, b):
    a //= b**i
    return a%b

def ok(a):
    return length(a) >= d

b = II()
s = SI()
d = int(s, b)
n = len(s)

# 最後の整数の桁数
a = binary_search(1, n, ok, True)

# leading0を付けたときの長さ
zd = d+(b**a-1)//(b-1)-1

# 最後の整数
r = zd//a

ans = digit(r, a-1-zd%a, b)

print(ans)