from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations,permutations
from copy import deepcopy
import sys
sys.setrecursionlimit(4100000)



if __name__ == '__main__':
    N, K = map(int, input().split())
    cnt = 0
    while N!=0:
        N //= K
        cnt += 1
    print(cnt) from fractions import gcd from collections import Counter, deque, defaultdict from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort from itertools import product, combinations,permutations from copy import deepcopy import sys sys sys.setrecursionlimit(4100000) sys.setrecursionlimit sys setrecursionlimit 4100000 if __name__ == '__main__':
    N, K = map(int, input().split())
    cnt = 0
    while N!=0:
        N //= K
        cnt += 1
    print(cnt) __name__ == '__main__' __name__ '__main__' N, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split K cnt = 0 cnt 0 while N!=0:
        N //= K
        cnt += 1
     N!=0 N 0 N //= K N K cnt += 1 cnt 1 print(cnt) print cnt cnt = 0 0 cnt N, K = map(int, input().split()) map(int, input().split()) N cnt += 1 1 cnt N //= K K N K = map(int, input().split()) map(int, input().split()) K
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations,permutations
from copy import deepcopy
import sys
sys.setrecursionlimit(4100000)



if __name__ == '__main__':
    N, K = map(int, input().split())
    cnt = 0
    while N!=0:
        N //= K
        cnt += 1
    print(cnt)