peterverebics/CodeNet_Python_118 huggingface dataset:
K = int(input())
A, B = map(int, input().split())

for i in range(int(A/K), int(B/K)):
    if(i%K==0):
        print('OK')
        break
print('NG')
K=int(input())
A,B=map(int,input().split())

for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        break
print("NG")
K = input()
K = int(K)
A,B = map(int,input().split())
if B/K >= 2 or A<=K:
	print("OK")
else:
	print("NG")
a = int(input())
b,c = (map(int,input().split()))
d=1
for i in range(b,c):
    if i%a==0:
        print('OK')
        break
    elif d==c-b:
        print('NG')
        break
    d+=1
K = int(input())
a, b = map(int, input().split())

if a < b // K * K:
    print('OK')
else:
    print('NG')
k = int(input())
a, b = map(int, input().split())
ans = 'OK' if b//k - (a+k-1)//k >= 1 or a%k==0 or b%k==0 else 'NG'
print(ans)
X = int(input())
n = 0
N = 100
while int(N) < X:
    N =int(N*1.01)
    n += 1
else: print(n)
K = int(input())

A, B = map(int, input().split())


print('NG' if B//K == A//K else 'OK')
inp = [input() for i in range(2)]
K = int(inp[0])
A,B = inp[1].split()
A,B = int(A),int(B)
c,bbb = 0,0
if 1<= A <= B <= 1000 and 1<= K <= 1000:
  for h in range(A,B,1):
    c = h % K
    if c == 0:
      bbb += 1
  if bbb > 0:
    print('OK')
  elif K == 1:
    print('OK')
  elif K ==A or K ==B:
    print('OK')
  else:
    print('NG')
K = int(input())
A,B = map(int,input().split())

max = B//K
judge = 0

for i in range(max):
    if(i==0):
        continue

    if A<=K*i and K*i<=B:
        judge = 1
        break

if judge==1:
    print("OK")
else:
    print("NG")
K = int(input())
A, B = map(int, input().split())

a = 0

for i in range(A, B+1):
  if i%K == 0:
    a+=1
  else:
    pass
if a != 0:
  print("Yes")
else:
  print("No")
k = int(input())
a, b = [int(i) for i in input().split()]

kk = a // k

while(kk <= 1000):
    kk = kk + k
    if(kk <= b and kk >= a):
        print("OK")
        exit()
    #print(kk)

    #j = j + 1

print("NG")
def main():
  k = int(input())
  a, b = map(int,input().split())
  if a%k==0 or b%k==0 or b-a<k:
    print('OK')
  else:
    print('NG')

if __name__ == '__main__':
  main()
K = int(input())
A,B = map(int,input().split())
a=0

for i in range(A,B):
    if i%K ==0:
        a+=1

if a>0:
    print('OK')
else:
    print('NG')
import random
import math
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("Yes")
no = lambda: print("No")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()
#---khan17---template
t = II()
a,b = MI()
print("OK" if a+t<=b or a%t == 0 or b%t == 0 else "NG")
k = int(input())
a, b = map(int, input().split())

if b - a >= k: print("OK")
else:
    c = b % k
    d = a % k
    if d >= c: print("OK")
    else: print("NG")
K = int(input())
A,B = map(int, input().split())
a=B-A
if a>=K:
    print("OK")
elif A % K == 0:
    print ("OK")
elif B % K == 0:
    print ("OK")
else:
    print ("NG")
K = int(input())
A,B = map(int,input().split())
flag = 0
for i in range(A,B+1):
  if i%K == 0:
    flag += 1
    print("Yes")
    break
if flag == 0:
  print("NG")
k = int(input())
a,b = map(int,input().split())

if b-a >= k:
  print('OK')
elif b%k==0 or a%k==0:
  print('OK')
else:
  print('NG')
K=int(input())
A, B = map(int, input().split())
a=A//K

if(1<a):
  if(a*K<=B):
    print("OK")
  else:
    print("NG")
else:
  print("NG")
K = int(input())
A,B = map(int,input().split())

a = (B//K) - (A//K)

if B<K:
    print("NG")

if A==B:
    if A % K == 0:
        print("OK")

    else:
        print("NG")

else:
    if a==0:
        print("NG")
    
    else:
        print("OK")
k = int(input())
a, b =  map(int,input().split())
if (a/k)*k + k <= b:
    print ('OK')
else:
    print ('NO')
K = int(input())
A, B = map(int, input().split())
integral_part = A // K
if K == 1 or A <= K * (integral_part + 1) <= B:
  print("OK")
else:
  print("NG")
k = int(input())
a, b = map(int,input().split())

res_k = (a//k + 1)*k

if res_k >= a and res_k <= b:
    print('OK')
else:
    print('NG')
# -*- coding: utf-8 -*-

k = int(input())
a, b = map(int,input().split())

ans = 'NG'

if b - a + 2 >= k:
    ans = 'OK'

print(ans)
K = int(input())
A, B = map(int, input().split())

for i in range (A, B):
    if i % K == 0:
        print("OK")
        break
    else:
        continue
k=int(input())
a,b=map(int,input().split())
if (b-a+1)/7>=k:
    print('OK')
else:
    print('NG')
k = int(input())
a, b = map(int, input().split())
if a % k == 0:
    print('OK')
elif (b-a) // k >= 1:
    print('OK')
else:
    print('NG')
x = int(input())
counter = 0
goukei = 100

while goukei < x:
    goukei = int(goukei*1.01)         ##goukei += int( goukei * 0.01)
    counter += 1
    
print(counter)
k=int(input())
a,b=map(int, input().split())
l=[]
for i in range (a,b):
    if i % 7 == 0:
        l.append(i)
if len(l)!=0:
    print("OK")
else:
    print("NG")
import math
account = 100
goal = int(input())
count = 0

while True:
  count += 1
  account = math.floor(account * 1.01)
  if account >= goal:
  	break
print(count)
K = int(input())
A,B = list(map(int, input().split()))

if B - A >= K or K == 1:
    print('OK')
else:
    print('NG')
K=int(input())
A,B=map(int,input().split())
if (A-1)/K == B/K:
  print('NG')
else:
  print('OK')
k = int(input())
a, b = map(int, input().split())

min = a // k
max = b // k

if max - min >0:
    print('OK')
else:
    print('NG')
K = int(input())
A, B = map(int, input().split())

for i in range(A, B +1):
  if K%i == 0:
    print("OK")
    exit(0)
print("NG")
k=int(input())
a,b=map(int,input().split())
print('NOGK'[(a//k!=b//k or a%k==0)::2] if a!=b else 'OK')
K = int(input().rstrip())
distance_range = list(map(int,input().split()))
if (distance_range[1]//K)*K >= distance_range[0]:
    print("Yes")
else:
    print("No")
n=int(input())
temp=list(map(int,input().rstrip().split()))
a=temp[0]
b=temp[1]
result="OK"
i=1
while a<b :

    a+=i
    i+=1
    if a%n == 0 :
        result="NG"
        break
print(result)
K = int(input())
A,B = map(int,input().split())
if B-A > K:
  print('OK')
elif B-A == 0:
  print('OK')
else:
  print('No')
k = int(input())
a,b = map(int, input().split())

for i in range(a, b+1):
    if i % k == 0:
      print('OK')
      break
    else:
      print("NG")
k = int(input())
a,b = map(int, input().split())
print('OK' if b - a >= k or k==1 or a%k == 0 or b%k == 0 else 'NG')
k = int(input())
[a, b] = [int(i) for i in input().split()]
sum = k
while sum <= b:
    sum += k
    if sum >= a and sum <= b:
        print("OK")
        break
else:
    print("NG")
k = int(input())
a, b = map(int,input().split())

if b//k - a//k > k:
    print("OK")
else:
    print("NG")
K = int(input())
A, B = map(int, input().split())

if (B//K) - (A//K) >= 1:
  ans = "OK"
elif A == B:
  if A % K == 0:
    ans = "OK"
  else:
    ans = "NG"
else:
  ans = "NG"
print(ans)
k = int(input())

a, b = map(int, input().split())
y = 0

for x in range(a, b+1):
  if x // k == 0:
    print("OK")
    y = 1

if y == 0:
  print("NG")
K = int(input())
A, B = map(int, input().split())
if A % K == 0 or B % K == 0 or B - A >= K:
    print("OK")
else:
    print("NO")
k = int(input())
a, b = map(int, input().split())

if a <= (b / k) * k: print('OK')
else: print('NG')
K = int(input())
A,B = map(int,input().split())
x = A % K
if K % A == 0 or K % B == 0:
    print("OK")
elif K - x <= B-A:
    print("OK")
else:
    print("NG")
X = int(input())
cnt = 0
y = 100
while y < X:
  y += y // 100
  cnt += 1
print(cnt)
import math
x=int(input())
t=100
count=0
while t<x:
    t+=math.floor(t*0.01)
    count+=1
print(count)
import sys
def input(): return sys.stdin.readline().rstrip()
import math

X = int(input())

ans = False
money = 100
year = 0
while money < X:
    money += money // 100
    year += 1

print(year)
def resolve():
    x = int(input())
    ans = 0
    money = 100
    while money < x:
        money *= 1.01
        money = int(money)
        ans += 1
    print(ans)
resolve()
X=int(input())
a=100
i=0
while a<X:
    a+=int(a//100)
    i+=1
print(i)
import math
x = int(input())

x_cnt = 100
cnt = 0
while(x_cnt < x):
    x_cnt = math.floor(x_cnt * 1.01)
    cnt += 1

print(cnt)
def main():
    X = int(input())
    N = 100
    ans = 0
    while True:
        N += int(N*0.01)
        ans += 1
        if N >= X:
            break
            
    print(ans)


if __name__ == "__main__":
    main()
X=int(input())
count=0
M=100
while M<X:
	M=int(M*1.01)
	count=count+1
print(count)
import math

x = int(input())
n = 100
resp = 0
while n < x:
    n = int(n * 1.01)
    resp += 1
print(resp)
X = int(input())
money = 100
cnt = 0
while money < X:
    money = int(money * 1.01)
    cnt += 1

print(cnt)
n=int(input())
a=100
count=0
while a<n:
	a=a+a//100
	count+=1
print(count)
# -*- coding: utf-8 -*-
x = int(input())
m = 100

for i in range(10 ** 18):
  if m >= x:
    print(i)
    break
  m = int(m * 1.01)
X = int(input())
year = 0
deposit = 100
while deposit < X:
    deposit = deposit*101//100
    year += 1
print(year)
X = int(input())
cnt = 0
val = 100
while True:
    val = int(val * 1.01)
    cnt += 1
    if X <= val:
        break
print(cnt)
X = int(input())

# import math
# print(math.log10(X)/math.log10(2))
a = 100
for i in range(1000000):
    a = int(a * 1.01)
    if a >= X:
        print(i+1)
        exit()
x=int(input())

d=100
y=d
i=0
while(y<x):
    y=int(y*1.01)
    i+=1

print(i)
import sys
#sys.exit()
#sorted( ,reverse=True)
X = int(input())
#S,T = map(int, input().split())
#A = list(map(int, input().split()))
#print(N)
#print(S,T)
#print(A)
#print('Yes')
#print('No')

cnt = 0
m = 100 
while m < X:
    m = int(m) * 1.01
    cnt += 1
 
print(cnt)
def LI():return list(map(int,input().split()))

# for i in range(10):
#     print(i&1^0)

x=int(input())
m=100
for i in range(5000):
    m=int(m*1.01)
    if m>=x:
        print(i+1)
        exit()
import math
X = int(input())
answer = 100
j = 0
while(answer <= X):
    answer = math.floor(answer * 1.01)
    j += 1
    if answer >= X:
        break
print(j)
money = 100
ans = 0
X = int(input())
while money < X:
    money = int(money * 1.01)
    ans += 1
print(ans)
X=int(input())
deposit=100
year=0
while(deposit<X):
  deposit=int(deposit/100)+deposit
  year=year+1

print(year)
from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)

def main():
    a = 100
    x = int(input())
    ans = 0
    while a < x:
        a += a // 100
        ans += 1
    print(ans)

main()
x = int(input())
y = 100
n = 0
while True:
    y = int(y * 1.01)
    n = n + 1
    if y >= x:
        break
print(n)
# -*- coding: utf-8 -*-
from sys import stdin, stdout


def read():
    x0 = stdin.readline().rstrip()
    return x0


def __main__():
    n = int(read())
    x = 100
    res = 0

    while x < n:
        x += x // 100
        res += 1

    r = str(res) + '\n'
    stdout.write(r)

    #res = str(m) + '\n'


    #res = str(max(m1, m2)) + '\n'
    #stdout.write(res)

__main__()

#a = [int(i) for i in read().split()]
x = int(input())
money = 100
i=0
while(money<x):
	money = int(money*1.01)
	i+=1
print(i)
import math


def actual(x):
    amount = 100

    count = 0

    while True:
        amount *= 1.01
        amount = math.floor(amount)

        count += 1

        if amount >= x:
            return count

x = int(input())
print(actual(x))
x = int(input())

cnt = 0
m = 100
while True:
    cnt += 1
    m = int(m * 1.01)
    if x <= m:
        print(cnt)
        break
X = int(input())
money = 100
ans = 1
while True:
    money += money // 100
    if money >= X:
        break
    ans += 1
print(ans)
k = int(input())

r = 0.01
s = 100
n = 5
i = 0
while True:
  if k <= s:
    break
  else:
    s = int(s * (1 + r))
    i = i + 1
print(i)
X=input()
n=100
for i in range(1,4000):
    n=int(n*1.01)
    if X<=n:
        print i
        quit()
import math

X = int(input())
yokin = 100
ans = 0
while yokin < X:
    yokin = int(yokin*1.01)
    
    ans += 1

print(ans)
X = int(input())
m = 100

cnt = 0
while True:
    cnt += 1
    m += m // 100
    if m >= X:
        print(cnt)
        break
#ABC165
x = int(input())
a = 100
ans = 0
while a < x:
    a = a*101//100
    ans+=1
print(ans)
import math
X=int(input())
#print(math.log(X/100)//math.log(1.01))
count=0
XX=100
while(X>XX):
    XX=math.floor(XX*1.01)
    count+=1
print(count)
x = int(input())
money = 100
years = 0
while money < x:
    money += int(money*0.01)
    years += 1
print(years)
x  = int(input())
t = 100
ans = 0
while t<x:
  t += t//100
  ans +=1

print(ans)
X=int(input())

t=100
cnt=0
while t<X:
    t+=int(t*0.01)
    cnt+=1
print(cnt)
i = 1
d = 100
n = int(input())

if n == 100:
    print(0)
else:
    while True:
        d = int(d * 1.01)
        if n <= d:
            break
        i = i + 1
    print(i)
def N():
    return int(input())
def L():
    return list(map(int,input().split()))
def NL(n):
    return [list(map(int,input().split())) for i in range(n)]
mod = pow(10,9)+7
#import numpy
y = 100
x = N()
cnt = 0
while(1):
    cnt += 1
    y = (y*101)//100
    #print(y)
    if y >= x:
        print(cnt)
        break
x = int(input())
chokin = 100
count = 0
while chokin < x:
    chokin = int(chokin *1.01)
    count += 1
print(count)
import math
X=int(input())
moto=100
count=0
while True:
    count+=1
    moto=math.floor(1.01*moto)
    if moto>=X:
        break
print(count)
x=int(input())
ans=0
now=100
while now<x:
	now*=1.01
	now=int(now)
	ans+=1
print(ans)
import math

x = int(input())
money = 100
year = 0

while money < x:
  money = math.floor(money*1.01)
  year += 1
print(year)
X=int(input())
 
x=100
for i in range(10**4):
    x += x//100
    if X <= x:
        print(i+1)
        break
X=int(input())
have=100
count =0
while True:
  have = int(have*1.01)
  count += 1
  if have >= X:
    print(count)
    break
def main():
    x = int(input())

    tmp = 100
    for i in range(1,10**10):
        tmp = int(tmp*1.01)
        if tmp >= x:
            print(i)
            return


if __name__ == '__main__':
    main()
X=int(input())
i=100
year=0
while i<X:
  i+=i//100
  year+=1
print(year)
x = int(input())

money = 100
t=0
while True:
    if money < x:
        t += 1
        money *= 1.01
        money = int(money)
    else:
        break
print(t)
def INT(): return int(input())
def MAP(): return map(int, input().split())


X = INT()

year = 0
cash = 100
while cash < X:
    year += 1
    cash = int(cash * 1.01)

print(year)
def solve(string):
    i, c = 0, 100
    while c < int(string):
        i += 1
        c = c * 1.01 // 1
    return str(i)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))
import sys
import math
input = sys.stdin.readline


def main():
    X = int(input())
    bank = 100
    i = 0
    while bank < X:
        bank = math.floor(bank*1.01)
        i += 1
    print(i)


if __name__ == '__main__':
    main()
# 金利1%
X = int(input())
ans = 0
now = 100
while X > now:
    ans += 1
    now = int(now * 1.01)
print(ans)
import math
X=int(input())
tmp=100
t=1
while tmp<X:
  tmp=math.floor(tmp*1.01)
  t+=1
print(t-1)
X = int(input())
t = 100
i = 1

while True:
  t = int(t*1.01)
  if t >= X:
    print(i)
    break
  i += 1
# -*- coding: utf-8 -*-

def input_one_number():
    return int(input())

def input_multiple_number():
    return map(int, input().split())

def input_multiple_number_as_list():
    return list(map(int, input().split()))

X = input_one_number()

m = 100

cnt = 0
while True:
	if X <= m:
		print(cnt)
		exit(0)

	m = (m * 1.01)//1
	cnt +=1
X=int(input())
ans=0
Y=100
while Y<X:
    Y+=Y//100
    ans+=1
print(ans)
import numpy as np
a=int(input())
n=100
count = 0
while n<a:
  n = int(1.01*n)
  count += 1
  
print(count)
import math

x = int(input())
n = 0
m = 100
while m < x:
    n += 1
    m = math.floor(m * 1.01)
print(n)
import math


def resolve():
    X = int(input())
    ans = 100
    year = 0
    while ans < X:
        ans = math.floor(ans * 1.01)
        year += 1

    print(year)


resolve()
import math

x = int(input())
money = 100
time = 0

while(money < x):
    money = math.floor(money * 1.01)
    time += 1

print(time)
X = int(input())

ans = 0
yokin = 100

while True:
    yokin = int(yokin * 1.01)
    ans += 1
    if yokin >= X:
        break
        
print(ans)
k=int(input())
n=100
y=0
while(n<k):
    n=int(n*1.01)
    y+=1
    #print(y,n)
print(y)
x = int(input())

m = 100
r = 1.01
i = 0
while m < x:
    m = int(m*1.01)
    i += 1

print(i)
count = 0
x = int(input())
bal = 100
while bal<x:
    count+=1
    bal = int(bal*(1.01))
print(count)
i=int(input())
sum=100
for j in range(1,100000000):
    sum=int(sum*1.01)
    if sum>=i:
        print(j)
        break
X = int(input())
ans = 100
count = 1

while(True):
    a = ans*0.01
    ans = ans + a
    ans = int(ans)
    #print(ans)

    if (X<=ans):
        print(count)
        break

    count += 1
X = int(input())

import math

# n年後のお金
def calcX(n):
  X = 100
  for i in range(n):
    X = math.floor(X * 1.01)
  return X

year = 0
while True:
  if X > calcX(year):
    year += 1
  else:
    print(year)
    break
x = int(input())
count = 0
y = 100
while True:
    y*=1.01
    y = int(y)
    count+=1
    if y>=x:
        print(count)
        exit()
import math
X = int(input())
m = 100
y = 1
while True:
    m += math.floor(m * 0.01)
    if m >= X:
        print(y)
        break
    y += 1
X = int(input())

ret = 0
cur = 100
while cur < X :
  cur = int(cur * 1.01)
  ret += 1
print(ret)
x=int(input())
c=100
year=0
while (c<=x):
  if(c==x):
    break
  year+=1
  c+=(c*1//100)
print(year)
X = int(input())
a = 100
ans = 0
while a < X:
	ans += 1
	a = int(a * 1.01)
print(ans)
a = 100
n = int(input())
c = 0
while(True):
    a += int((a * .01))
    if(a >= n):
        break
    c += 1   
print(c + 1)
X = int(input())

tmp = 100
cnt = 0
while tmp < X:
    tmp = tmp + int(tmp*0.01)
    cnt += 1

print(cnt)
x = int(input())
#ゴリ押し解法
mny = 100
count = 0
while(x > mny):
	mny += int(mny*0.01)
	count += 1
print(count)
X = int(input())

count = 0
temp = 100
ans = 0
while True:
    temp+=temp//100
    count += 1
    ans  = temp
    if ans>=X:
        break
print(count)
X = int(input())
a = 100
i = 0

while a < X:
  i += 1
  a += a // 100
  
print(i)
X = int(input())

n = 0
Xn = 100

while Xn < X:
    n = n+1
    Xn = Xn + int(Xn*0.01)

print(n)
X = int(input())
money = 100
for i in range(10**12):
    money = int(money * 1.01)
    if money >= X:
        print(i+1)
        break
k = int(input())

x = 100
cnt = 0

while(1):
    x *= 1.01
    x = int(x)
    cnt += 1
    if x >= k:
        break
        
print(cnt)
X = int(input())
amt = 100
year = 0
while amt < X:
    amt = int(amt * 1.01)
    year += 1
print(year)
X = int(input())

ans = 0
money = 100
for i in range(1, 10**18):
    money = (money * 101) // 100
    if money >= X:
        ans = i
        break

print(ans)
X = int(input())
x = 100
c = 0
while x < X:
    c += 1
    x += int(x * 0.01)
print(c)
from math import floor

def main():
    X=int(input())
    tmp=100
    for year in range(1,4000):
        tmp *= 1.01
        tmp = floor(tmp)
        if tmp >= X:
            print(year)
            exit()

main()
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from math import floor
def main():
    x = int(readline())
    a = 100
    i = 0
    while a < x:
        a =  floor(a*(1.01))
        i+=1
    print(i)
if __name__ == '__main__':
    main()
x=int(input())

m=100
cnt=0
while m<x:
  cnt+=1
  m=m+int(m*0.01)
print(cnt)
x=int(input())

s=100

from itertools import count

for c in count(0):
    if s >= x:
        print(c)
        exit()
    s = int(s * 1.01)
X = int(input())
m = 100
ans = 0
while X > m:
    m += int(m*0.01)
    ans += 1

print(ans)
X = int(input())
i = 0
deposit = 100
while deposit < X:
    deposit = int(deposit * 1.01)
    i += 1
    
print(i)
X=int(input())

ans=100
now=100
cnt=0
while(True):
  if X<=now:
    break
  else:
    now=int(now+now*0.01)
    cnt+=1
print(cnt)
import math
x=int(input())
cnt=0
origin=100
while origin <x:
    origin=math.floor(origin*1.01)
    cnt+=1
print(cnt)
X = int(input())
money = 100
count = 0
while money < X:
    money = int(money*1.01) 
    count +=1
print(count)
X = int(input())

def oneyear(m):
    return m + m//100

y = 0
m = 100
while m < X:
    m = oneyear(m)
    y += 1

print(y)
x = int(input())
import math

num =  0
s = 100
while True :
    num += 1
    s += math.floor(s * 0.01)
    if  s >= x:
        break
    else:
        continue
print(num)
import math

X = int(input())

A = 100
t = 0
while A < X:
    A *= 1.01
    A = math.floor(A)
    t += 1

print(t)
import numpy as np

x = int(input())
base = 100

year = 0
while base < x:
    base = int(base * 1.01)
    year += 1

print(year)
x = int(input())
money = 100
year = 0

for i in range(1, (10**18)):
    #print(i)
    money = int(money*1.01)
    if money >= x:
        year = i
        break

print(year)
x = int(input())
ans = 0
val = 100
while val < x:
    val = int(val * 1.01)
    ans += 1
print(ans)
x = int(input())
a = 100
count = 0
while a < x:
    a = int(a*1.01)
    count += 1
print(count)
X = int(input())

ans = 0
num = 100
while X > num:
    num = num+num//100
    ans += 1

print(ans)
X=int(input())
n=100
y=0
while n<X:
    y+=1
    n+=int((n*0.01))
print(y)
x = int(input())
ans = 0
money = 100
while True:
    money = int(money * 1.01)
    ans += 1
    if money >= x:
        print(ans)
        exit()
X = int(input())
n = 100
a = 0
while n < X:
    n = int(n * 1.01)
    a = a + 1
print(a)
X = int(input())


kouza = 100
count = 0
while X > kouza:
     kouza = int(kouza * 1.01)
     count += 1
print(count)
X = int(input())

S = 100
Y = 0

while X > S:
    S += S // 100
    Y += 1

print(Y)
X = int(input())

N = X - 100
ans = 100
for i in range(10000):
  if X <= ans:
    print(i)
    break
  ans += ans // 100
x=int(input())
flag="False"
n=0
y=100
while flag=="False":
  n+=1
  y=int(y*1.01)
  if y>=x:
    flag="True"
print(n)
import math
X = int(input())
curr = 100
yrs = 0
while curr < X:
    curr = math.floor(curr * 1.01)
    yrs += 1
print(yrs)
import math

X=int(input())

A=100
n=0
while X>A:
    A *= 1.01
    
    A=int(A)
    #print(A)
    n+=1
#N=int(math.log(X/100, 1.01))+1

print(n)
x = int(input())

money = 100
ans = 0
while money < x:
    ans += 1
    money *= 101
    money //= 100

print(ans)
import sys
import math as mt
import collections as cc
I=lambda:list(map(int,input().split()))
n,=I()
x=100
i=0
while x<n:
    i+=1
    temp=x*0.01
    x+=mt.floor(temp)
    
    
print(i)
x = int(input())

count = 1
a = 100
while True:
  a *= 1.01
  a = int(a)
  if int(a) >= x:
    break
  else:
    count += 1
print(count)
n = 100
ans = 0
X = int(input())

while n < X:
    n = n + int(n*0.01)
    ans += 1
    
print(ans)
X = int(input())
v = 100
for i in range(1, 3761):
    v *= 1.01
    v = int(v)
    if v>=X:
        print(i)
        break
from sys import stdin
import math

if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    X = int(_in[0])  # type:int
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    yen = 100
    cnt = 0
    while (yen<X):
        yen = math.floor(yen*1.01)
        cnt += 1
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(cnt)
import math
X = int(input())

total = 100
ans = 0
while total < X:
  total = math.floor(total * 1.01)
  ans += 1
  
print(ans)
X = int(input())

years = 0
money = 100
while(True) :
    years += 1
    money += int(money * 0.01)
    if (X <= money) :
        break

print(years)
def solve(x):
    y = 100
    ans = 0
    while y < x:
        y = int(y * 1.01)
        ans += 1
    return ans

x = int(input())
print(solve(x))
import math
x=int(input())
ans=0
money=100
while money<x:
  money=money*(1.01)
  money=int(money)
  ans+=1
print(ans)
x=int(input())
c=100
time=0
while c<x:
  c+=c//100
  time+=1
print(time)
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

x = int(input())
now = 100
ans = 0
while True:
    if now >= x:
        print(ans)
        break
    ans += 1
    now = floor(now * 1.01)