import string

n,k=list(map(int,input().split()))

numbers="0123456789"

alphabets=string.ascii_letters

characters=numbers+alphabets



def base_cvt(value, n=2):

    tmp=int(value)

    result = ''

    while tmp >= n:

        idx = tmp%n

        result = characters[idx] + result

        tmp = int(tmp / n)

    idx = tmp%n

    result = characters[idx] + result

    return result

print((len(base_cvt(str(n),k))))
import math

k, n = list(map(int,input().split()))

ans = math.log(k,n)

if ans == 0:

    ans = 1

print((math.ceil(ans)))
import string

n, k = list(map(int, input().split()))
numbers = "0123456789"
alphabets = string.ascii_letters
characters = numbers + alphabets


def base_cvt(value, n=2):
    tmp = int(value)
    result = ""
    while tmp >= n:
        idx = tmp % n
        result = characters[idx] + result
        tmp = int(tmp / n)
    idx = tmp % n
    result = characters[idx] + result
    return result


print((len(base_cvt(str(n), k))))

import math

k, n = list(map(int, input().split()))
ans = math.log(k, n)
if ans == 0:
    ans = 1
print((math.ceil(ans)))

-import string +import math -n, k = list(map(int, input().split())) -numbers = "0123456789" -alphabets = string.ascii_letters -characters = numbers + alphabets - - -def base_cvt(value, n=2): -    tmp = int(value) -    result = "" -    while tmp >= n: -        idx = tmp % n -        result = characters[idx] + result -        tmp = int(tmp / n) -    idx = tmp % n -    result = characters[idx] + result -    return result - - -print((len(base_cvt(str(n), k)))) +k, n = list(map(int, input().split())) +ans = math.log(k, n) +if ans == 0: +    ans = 1 +print((math.ceil(ans)))