Problem:
 Score : 200 points    Problem Statement  Takahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.  The bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)  Assuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?      Constraints   101 \le X \le 10^{18}  All values in input are integers.         Input  Input is given from Standard Input in the following format:  X       Output  Print the number of years it takes for Takahashi's balance to reach X yen or above for the first time.        Sample Input 1 103      Sample Output 1 3   The balance after one year is 101 yen.  The balance after two years is 102 yen.  The balance after three years is 103 yen.   Thus, it takes three years for the balance to reach 103 yen or above.       Sample Input 2 1000000000000000000      Sample Output 2 3760       Sample Input 3 1333333333      Sample Output 3 1706

Solution (Python):
import sys


x = int(input())
a = 100
i = 0
while a < x:
    i += 1
    a = int(a * 1.01)
print(i)

Solution (Python):
X = int(input())

M = 100

Y = 0

while M < X:
    M += M // 100
    Y += 1

print(Y)

Solution (Python):
x = int(input())
ans = 0
k = 100
while 1:
    if k >= x:
        print(ans)
        break
    k = int(k*1.01)
    ans += 1

Solution (Python):
import math

X = int(input())
amount = 100

ans = 0
while amount < X:
    amount = math.floor(amount * 1.01)
    ans += 1
print(ans)

Solution (Python):
X = int(input())
k = 0
n = 100

while n < X:
    n = 1.01*n
    n = int(n)
    k = k+1

print(k)

Solution (Python):
x = int(input())

a = 100
c = 0

while a < x:
    a = int(a * 1.01)
    c = c + 1

print(c)

Solution (Python):
x = int(input())
money=100
cnt = 0

while(money<x):
    money  = int(money*1.01)
    cnt += 1
print(cnt)

Solution (Python):
X = int(input())
cnt = 0
money = 100
while True:
    cnt += 1
    money = int(money*1.01)
    if X <= money:
        break
print(cnt)

Solution (Python):
x = int(input())
money = 100
ans = 0
while True:
  money = (money*1.01)//1
  ans +=1
  if money >= x:
    break
print(ans)

Solution (Python):
import sys
import math
input = sys.stdin.readline


A = int(input())

x = 100
i = 0

while x < A:
    x = math.floor(x * 1.01)
    i = i + 1

print (i)

Solution (Python):
X = int(input())
cnt = 0
chokin = 100
while True:
    chokin *= 1.01
    chokin = int(chokin)
    cnt += 1
    if chokin >= X:
        print(cnt)
        exit()

Solution (Python):
import math
X = int(input())
money = 100
year = 0
while X > money:
    money *= 1.01
    money = math.floor(money)
    year += 1

print(year)

Solution (Python):
x = int(input())
y = 100
for i in range(1, 3761):
    y = int(y * 1.01)
    if y >= x:
        print(i)
        break

Solution (Python):
import math
x = int(input())

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

print(n)

Solution (Python):
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)

Solution (Python):
x=int(input())
have_money=100
yokin=[]
i=0
while True:
    i+=1
    yokin.append(have_money+(have_money)//100)
    if yokin[i-1]>=x:
        print(i)
        exit()
    have_money+=(have_money)//100

Solution (Python):
X = int(input())
tmp = 100
count = 0
while tmp < X:
    tmp = int(tmp * 1.01)
    count += 1
print(count)

Solution (Python):
import math
X = int(input())
A = 100
Cnt = 0
while A<X:
	A = math.floor(A*1.01)
	Cnt +=1
print(Cnt)

Solution (Python):
import math
k = int(input())
cnt = 0
yen = 100
while True:
    yen = math.floor(yen+yen*0.01)
    cnt += 1
    if yen >= k:
        print(cnt)
        break

Solution (Python):
from math import floor

x = int(input())

ans = 0
d = 100
while d < x:
    ans += 1
    d = floor(d * 1.01)
print(ans)

Solution (Python):
x = int(input())
i = 0
y = 100
while True:
    
    if y >=x:
        print(i)
        break
    i = i+1
    y = int(y*1.01)

Solution (Python):
x = int(input())

m = 100
y = 0

while m < x:
    m += int(m*0.01)
    y += 1

print(y)

Solution (Python):
def main():
    x = int(input())
    a = 100
    ct = 0
    while a<x:
        a = int(a*1.01)
        ct+=1
    print(ct)

main()

Solution (Python):

x = int(input())

num = 100
for i in range(10**10):
    num = num * 1.01
    num = int(num)
    if num >= x:
        print(i+1)
        break

Solution (Python):
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    X = input_number()
    t = 100
    cnt = 0
    while t < X:
        t = int(t * 1.01)
        cnt += 1
    print(cnt)


if __name__ == '__main__':
    main()

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

Solution (Python):
import math
X = int(input())
cnt = 0
X_aft = 100
while X_aft < X:
  X_aft = math.floor(X_aft*1.01)
  
  cnt += 1
print(cnt)

Solution (Python):
import math

A = int(input())
X = 0
N = 100

while N < A:
    N = N * 1.01
    N = math.floor(N)
    X += 1
    
    
    
print(X)

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools










X = int(input())
ans = 100
temp=0
while True:
    ans=ans+int(ans*0.01)
    temp +=1
    if(X<=ans):
        print(temp)
        break

Solution (Python):
t=int(input())
k=100000
p=100
for i in range(1,k):
	p=int(p*1.01)
	if (p>=t):
		print (i)
		break

Solution (Python):
x = int(input())
a = 100
c = 0

while True:
    c += 1
    a = a + int(a * 0.01)
    if a >= x:
        print(c)
        break

Solution (Python):
k=int(input())


a=100
for i in range(1,k+1):
    a+=int(a*0.01)
    if a >= k:break


print(i)

Solution (Python):
goal=int(input())
money=100
count=0
while(money<goal):
    money=int(money*1.01)
    count+=1
print(count)

Solution (Python):
X = int(input())
m = 100
cnt = 0
for i in range(1,4000):
    m = int(m*1.01)
    if m >= X:
        cnt = i
        break
print(cnt)

Solution (Python):
import sys
input = sys.stdin.readline

x = int(input())

y = 100
i = 0

while True:
    i += 1
    y += int(y*0.01)
    if y >= x:
        print(i)
        sys.exit()

Solution (Python):
if __name__ == "__main__":
    y = int(input())
    d = 100
    c = 0
    while d <= y:
        if d == y:
            break
        d = d + ((d*1) // 100)
        c += 1
    print(c)

Solution (Python):



import sys
import math

def input():
    return sys.stdin.readline()


def resolve():
    x = int(input())

    count = 0

    a = 100

    while True:
        a = a * 1.01
        a = math.floor(a)
        count += 1

        if a >= x:
            break

    print(count)


if __name__ == "__main__":
    resolve()

Solution (Python):
import math
x = int(input())
y = 100
count = 0
while y < x:
  count += 1
  y = math.floor(y*1.01)
print(count)

Solution (Python):
a = 100
b = int(input())
count = 0
while True:
    a = int(a*1.01)
    count += 1
    if a >= b:
        break
print(count)

Solution (Python):
X = int(input())
P = 100
i = 0
while(X > P):
    P = int(P * 1.01)
    i = i + 1
print(i)

Solution (Python):
X = int(input())
i = 1
money = 100
while True:
  money = money + int(money * 0.01)
  if money >= X:
    break
  i = i+ 1
print(i)

Solution (Python):
x = int(input())
m = 100
y = 0
while m < x:
  m = int(m*1.01)
  y += 1
print(y)

Solution (Python):
x = int(input())
count = 0
money = 100
while True:
    count += 1
    money = int(money*1.01)
    if money >= x:
        break
print(count)

Solution (Python):
X = int(input())
money = 100
year = 0
while X > money :
    money = int(1.01*money)
    year += 1
print(year)

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

print(i)

Solution (Python):
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

x = NextInt()
ans = 0
now = 100
while(now < x):
    ans+= 1
    now = int(now*1.01)
print(ans)

Solution (Python):
x=int(input())
m=100
cnt=0
while x>m:
    cnt+=1
    m=(m*1.01)//1
print(str(cnt))

Solution (Python):
X=int(input())
a=100
K=0
while a<X:
    a=int(a*1.01)
    K+=1

print(K)

Solution (Python):
X=int(input())
res=100.0
y=0
while(True):
    if res>=X:
        print(y)
        exit()
    res=int(res*1.01)
    y+=1

Solution (Python):
a=int(input())
n=100
cnt=0
while n<a:
    n*=101/100
    n=int(n)
    cnt+=1
print(cnt)

Solution (Python):
import math

x = int(input())
bank = 100
year = 0
while True:
    year += 1
    bank = math.floor(bank * 1.01)
    if bank >= x:
        print(year)
        break

Solution (Python):
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7

X = INT()
a = 100
count = 0
while(a < X):
    a += a//100
    count += 1

print(count)

Solution (Python):
X = float(input())
ans = 100
i = 0
while(ans < X):
    i += 1
    ans = (float(ans) * 1.01) // 1

print(i)

Solution (Python):
import math

X = int(input())
count = 0
money = 100

while(X > money):
    money = math.floor(money + money * 0.01)
    count+=1
print(count)

Solution (Python):
x = int(input())
c = 100
i = 0
while c<x:
    c = int(c)*1.01
    i += 1
print(i)

Solution (Python):
import sys
import math
x = int(input())
p = 100
a = 0
while True:
    a += 1
    p = p + math.floor(p * 0.01)
    if p >= x:
        print(a) 
        sys.exit()

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

Solution (Python):
x=int(input())
a=100
for i in range(10000000):
  a=a*1.01//1
  if a>=x:
    break
print(i+1)

Solution (Python):
x = int(input())
num = 100
cnt = 0
while num < x:
    cnt += 1
    num = int(num * 1.01)
print(cnt)

Solution (Python):
a = int(input())
cnt=0
money=100
while a > money:
    money = money + int(money * 0.01)
    cnt += 1
print(cnt)

Solution (Python):
x = int(input())

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

Solution (Python):
X = int(input())
a = 100
cnt = 0

while a < X:
    a =  int(a*1.01)
    cnt += 1
print(cnt)

Solution (Python):
X = int(input())

c = 100
i = 1
while True:
    c = int(c*1.01)
    
    if int(c) >= X:
        break
    i += 1
print(i)

Solution (Python):
n = int(input())
i = 100
nen = 0
while i < n:
  nen += 1
  i = int(i*1.01)
print(nen)

Solution (Python):
import sys
x = int(input())
s=100

for y in range (1,100000):
  s1=int(s*1.01)
  if (s1 >= x):
    print (y)
    sys.exit()
  s=s1

Solution (Python):
t=int(input())
k=100000
p=100
for i in range(1,k):
	p=int(p*1.01)
	if (p>=t):
		print (i)
		break

Solution (Python):
X = int(input())
yen = 100
count = 0

while True:
  yen *= 1.01
  yen = int(yen)
  count += 1
  if yen >= X:
    print(count)
    break

Solution (Python):
ma = lambda :map(int,input().split())
ni = lambda:int(input())
import math
x = ni()
m = 100
for i in range(10**8):
    m = m*1.01//1
    if m>=x:
        print(i+1)
        break

Solution (Python):
X = int(input())
money = 100
n = 0
while money < X:
    money = int(1.01 * money)
    n+=1
print(n)

Solution (Python):
X=int(input())
count = 0
a=100
while a<X:
    a=int(a*1.01)
    count+=1
print(count)

Solution (Python):
X = int(input())

yokin = 100
i = 0
while yokin <X:

    yokin = (yokin*1.01)//1
    i += 1
print(i)

Solution (Python):
X = int(input())
count = 0
start = 100
while(X>start):
    start += int(start*0.01)
    count+=1
print(count)

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

Solution (Python):
x = int(input())
ans = 100
for i in range(1, 10**18):
    ans += int(ans*0.01)
    if ans >= x:
        print(i)
        exit()

Solution (Python):
import math

X = int(input())

years = 0
cur = 100

while cur < X:
  cur += int(cur / 100)
  years += 1

print(years)

Solution (Python):

import sys
import math

X =int(sys.stdin.readline())

temp = 100
count = 0
while temp < X:
    temp = math.floor(temp * 1.01)
    count += 1
print(count)

Solution (Python):
X = int(input())

M = 100
mada = True
year = 0
while mada:
    if M >= X:
        mada = False
    else:
        M = int(M*1.01)
        year += 1
print(year)

Solution (Python):
X=int(input())
money=100
ans=0
while money<X:
  money=int(money*1.01)
  ans+=1
print(ans)

Solution (Python):
X=int(input())
ans=0
a=100
while a<X:
  a=a*(1.01)//1
  ans+=1
print(ans)

Solution (Python):
n = int(input())
x = 100

for i in range(1,1000000):
    x = x + x//100
    if(x >= n):
        print(i)
        break

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

Solution (Python):
import math
x = int(input())
y = 100
c = 0

while True:
	c += 1
	y *= 1.01
	y = math.floor(y)

	if y >= x:
		break

print(c)

Solution (Python):
x=int(input())
m=100
c=0
while m<x:
    c+=1
    m+=m//100
print(c)

Solution (Python):
X = int(input())

flag = True

money = 100
i = 0
while flag:
    i += 1
    money = money + int(money*0.01)
    if money >= X:
        break
print(i)

Solution (Python):
X = int(input())
S = 100
n = 0
while X > S:
    S = 1.01 * S
    S = S // 1
    n += 1

print(n)

Solution (Python):
x=int(input())
money=100
year=0
while money < x:
    money=int(money*1.01)
    year+=1

print(year)

Solution (Python):

X = int(input())
a = 100
r = 0.01
for i in range(1000000):
    a = int(a*(1+r))
    if a >= X:
        print(i+1)
        exit()

Solution (Python):
x = int(input())
count = 0
money = 100
while money < x:
	money = int(money * (1.01))
	count += 1

print(count)

Solution (Python):
import math
x = int(input())

money = 100
count = 0
while money < x:
    money += math.floor(money * 0.01)
    count += 1

print(count)

Solution (Python):
money = 100
ans = 0
X = int(input())
while money < X:
    money = int(money * 1.01)
    ans += 1
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline

x = int(input())
ans = 100

for i in range(1,10000000000):
    ans += int(ans/100)
    if ans >= x:
        print(i)
        break

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)  
to_index = lambda x: int(x) - 1  
print_list_in_2D = lambda x: print(*x, sep="\n")  


def input_int(): return int(input())

def map_int_input(): return map(int, input())

MII = map_int_input

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

def MII_to_index(): return map(to_index, input())

def MII_split_to_index(): return map(to_index, input().split())


def list_int_inputs(): return list(map(int, input()))

LII = list_int_inputs

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


def LII_2D(rows_number): return [LII() for _ in range(rows_number)]

def LII_split_2D(rows_number): return [LII_split() for _ in range(rows_number)]

import math
X = input_int()

budget = 100
count = 0
while budget < X:
    budget *= 1.01
    budget = int(budget)
    count += 1
print(count)

Solution (Python):
import math
X=int(input())
A=100
i=0
while A<X:
  A=int(A*1.01)
  i+=1
print(i)

Solution (Python):

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

Solution (Python):
x = int(input())

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

Solution (Python):
import math 
a = 100
X = int(input())

cnt = 0
for i in range(2*(10**5)):
  if(a>=X):
    break 
  a = int(a*1.01) 
  cnt += 1
  
print(cnt)

Solution (Python):
x = int(input())
money = 100
i = 1
while True:
    money *= 1.01
    money = int(money)
    if money >= x:
        break
    i += 1
print(i)

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

Solution (Python):
import math

x = int(input())
i = 1
v = 100
while True:
    v = int(1.01 * v)
    if v >= x:
        break
    i += 1
print(i)

Solution (Python):
x = int(input())

m = 100
y = 0

while m < x:
    m = int(m *1.01)
    y += 1

print(y)

Solution (Python):
X = int(input())


tmp = 100
i = 0
while 1:
    if tmp >= X:
        break
    else:
        tmp = tmp * 1.01
        tmp = int(tmp)
        i += 1
print(i)

Solution (Python):
num = input()
a = 100
count = 0
while count>=0:
    a = int(a * 1.01)
    count = count + 1
    if a>=int(num):
        break
print(count)

Solution (Python):
X = int(input())

Y=100
i=0

while Y<X:
  Y= int(Y*1.01)
  i+=1
print(i)

Solution (Python):
X = int(input())

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

print(ans)

Solution (Python):
X = int(input())
m = 100
y = 0
while m < X:
    m += 0.01*m
    m = int(m)
    y += 1
print(y)

Solution (Python):
X = int(input())
x = 100
c = 0
while x < X:
    x = int(x *1.01)
    c += 1
print(c)

Solution (Python):



X = int(input())
now = 100
ans = 0

while now < X:
    now = now * 101 // 100
    ans += 1

print(ans)

Solution (Python):
import math
X=int(input())
i=1
a=100
while  True:
    
    a=math.floor(a*1.01)
    
    if a>=X:
        print(i)
        break
    i=i+1

Solution (Python):

from math import gcd
from functools import reduce
from itertools import product

def resolve():
  X = int(input())

  years = 0
  money = 100
  while money < X:
    money = int(money * 1.01)
    years += 1
  print(years)

if __name__ == "__main__":
    resolve()

Solution (Python):

import math
x = int(input())
count = 0
cash = 100.0
while cash < x:
    cash *= 1.01
    cash = math.floor(cash)
    count += 1
print(count)

Solution (Python):

import sys

DEBUG = True if (len(sys.argv) > 1 and sys.argv[1] == "DEBUG") else False


def dp(value):
    if DEBUG:
        print(value)
    return


def input_text(split=" "):
    
    result = []
    while True:
        try:
            row = list(
                map(lambda x: int(x) if x.isdecimal() else x, input().split(split))
            )
            result.append(row)
        except EOFError:
            break
    return result



it = input_text()

x = it[0][0]
a = 100
y = 0

while True:
    y += 1
    risoku = int(a * 0.01)
    a += risoku
    if a >= x:
        print(y)
        sys.exit()

Solution (Python):
x = int(input())
m = 100
for i in range(1, 4000):
    m = m + m//100
    if x <= m:
        print(i)
        exit()

Solution (Python):
import math
X=int(input())
i = 0
cash = 100
while True:
  i+=1
  cash = math.floor(cash*1.01)
  if cash>=X: break

print(i)

Solution (Python):
import math

X = int(input())

total = 100

for i in range(1, 3761):
    total += math.floor(total * 0.01)
    if X <= total:
        print(i)
        exit()

Solution (Python):
import math
x=int(input())
money=100
ans=0
while money<x:
  money=math.floor(money*1.01)
  ans +=1
print(ans)

Solution (Python):
a=int(input())
count=0
b=100
while b<a:
  b=b*1.01
  b=int(b)
  count+=1
print(count)

Solution (Python):
def resolve():
    
    x = int(input())
    
    
    
    
    
    
    
    

    a=100
    for i in range(1,10**16):
        a=int(a*1.01)
        if a >= x:
            print(i)
            break

    


resolve()

Solution (Python):
X = int(input())
year = 0
ta = 100
while ta < X:
    year+=1
    ta = int(ta*1.01)

print(year)

Solution (Python):
N = int(input())
year = 0
n = 100.0
while(N>n):
  n = int(n*1.01)
  year += 1
print(year)

Solution (Python):
x=int(input())
money=100
year=0

while money<x:
  money+=money//100
  year+=1

print(str(year))

Solution (Python):
x = int(input())

chokin = 100
i = 0
while True:
    chokin += chokin//100
    i += 1
    if chokin >= x:
        break

print(i)

Solution (Python):
n = int(input())
wa = 100
j = 0
while wa < n:
    wa = int(wa * 1.01)
    j += 1
print(j)

Solution (Python):
x=int(input())
a=100
i=1
while 1:
    a=int(a*1.01)
    if x<=a:
        print(i)
        exit()
    i+=1

Solution (Python):
import math
x = int(input())

ans = 100
cnt = 0
while(True):
  ans += math.floor(ans*0.01)
  cnt += 1
  if ans >= x:
    print(cnt)
    break

Solution (Python):
def main():
  x = int(input())
  tmp = 100
  count = 0
  while tmp < x:
    tmp = int(tmp * 1.01)
    count += 1
    
  return count

print(main())

Solution (Python):
import math
X = int(input())
N = 100
t = 0
while N<X:
    t+=1
    N = int(N*1.01)
print(t)

Solution (Python):
X=int(input())

A=100
ans=1
while A<X:
    A=int(A*1.01)
    ans+=1

print(ans-1)

Solution (Python):
import math 


x = int(input())
m = 100
y = 0
while x > m:
    y += 1
    m = m + math.floor(m*0.01)
print(y)

Solution (Python):
X = int(input())

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

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

print(y)

Solution (Python):
x=int(input())
charge=100
for i in range(4000):
    charge=int(charge*1.01)
    if charge>=x:
        print(i+1)
        break

Solution (Python):
x=int(input())
sum=100
year=0
while True:
 if sum<x:
  sum=int(sum*1.01)
  year=year+1
 else:
  break
print(year)

Solution (Python):
import math
X = int(input())
yokin=100
year=0
while yokin<X:
    yokin=math.floor(yokin*1.01)
    year+=1
print(year)

Solution (Python):
x = int(input())
y = 100
cnt = 0
while 1:
    cnt += 1
    y *= 1.01
    y = int(y)
    if y >= x:
        break
print(cnt)

Solution (Python):


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

Solution (Python):
import math

def solve(x):
    init_money = 100

    i = 0
    while True:
        i += 1
        init_money = math.floor(init_money * 1.01)
        if init_money >= x:
            break
    return i
if __name__ == "__main__":
    x = int(input())
    print(solve(x))

Solution (Python):
import sys
sys.setrecursionlimit(10**6) 
import math
from copy import copy, deepcopy
from operator import itemgetter

from bisect import bisect_left, bisect, bisect_right

from collections import deque 



from collections import Counter

from itertools import accumulate

from heapq import heapify,heappop,heappush


def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds




X = int(input())




y=0
cx=100
while cx<X:
    cx=math.floor(cx*1.01)
    y+=1
print(y)

Solution (Python):
import math
x = int(input())
cnt = 0
sm = 100
while True:
    sm = int(sm * 1.01)
    cnt += 1
    if sm >= x:
        print(cnt)
        exit(0)

Solution (Python):
import sys
import math
input = sys.stdin.readline
input = sys.stdin.buffer.readline

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    X = II()
    i = 0
    M = 100
    
    while True:
        i += 1
        M = M + math.floor(M * 0.01)
        if M>=X:
            break
    
    print(i)



if __name__ == "__main__":
	main()

Solution (Python):
x=int(input())
money=100
q=0
while True:
  
  if money>=x:
    break
  money=int(money*1.01)
  q+=1
print(q)

Solution (Python):
x = int(input())

n = 100
ans = 0
while n < x:
    n = int(n * 1.01)
    ans += 1

print(ans)

Solution (Python):
x = int(input())
n = 100
 
for i in range(1000000):
	n = (n * 101) // 100
	if n >= x:
		print(i + 1)
		break

Solution (Python):
import math

x=int(input())
count=0
ans=100

while ans<x:
    ans=math.floor(ans*1.01)
    count+=1

print(count)

Solution (Python):
from itertools import count
X = int(input())

d = 100 

for n in count(1):
  d = int(d * 1.01)
  if d >= X:
    print(n)
    break

Solution (Python):
x=int(input())
p=100
for i in range(1,3761):
    p+=p//100
    if p>=x: print(i); break

Solution (Python):
X = int(input())

cnt = 0
yokin = 100
while yokin < X:
    yokin = int(yokin*1.01)
    cnt += 1
print(cnt)

Solution (Python):
x=int(input())
a=100
ans=0
while (a<x):
    ans+=1
    a=int(a*1.01)

print(ans)

Solution (Python):
x = int(input())
a = 100
ans = 0
while True:
    ans += 1
    a += a//100
    if a >= x:
        print(ans)
        break

Solution (Python):
X = int(input())
money = 100
cnt = 0
while money < X:
    money = int(money * 1.01)
    cnt += 1

print(cnt)

Solution (Python):
x=int(input())
money=100
year=0
while money<x:
    year+=1
    money+=(money//100)
print(year)

Solution (Python):


def solve():
    X = int(input())
    Y = 100
    i = 0
    while X > Y:
        Y += Y//100
        i += 1
    return str(i)

if __name__ == '__main__':
    print(solve())

Solution (Python):
X = int(input())
cn = 100
year = 0
while cn < X:
    cn = int(cn * 1.01)
    year += 1
print(year)

Solution (Python):
from sys import stdin
n = int(stdin.readline().rstrip())
a = 100
k = 0
while a < n:
    a *= 1.01
    a = int(a)
    k += 1
print(k)

Solution (Python):
import math

X = int(input())
Y = 100
Z = 0

while Y < X:
    Y = math.floor(Y * 1.01)
    Z += 1

print(Z)

Solution (Python):
X = int(input())

money = 100
cnt = 0

while money < X:
    money = int(money * 1.01)
    cnt += 1

print(cnt)

Solution (Python):
x = int(input())
now = 100
for kek in range(123123):
	if(now >=x):
		print(kek)
		exit(0)
	now = (now* 101) //100

Solution (Python):
import sys
import math

inputLine=input()
X=int(inputLine)

yokin=100
year=0

while(True):
    year += 1

    yokin = yokin + (yokin * 0.01)
    yokin = math.floor(yokin)

    if yokin >= X:
        print(year)
        sys.exit()

Solution (Python):
def main():

    x = int(input())
    y = 100
    i = 0
    while True:
        i += 1
        y = int(y * 1.01)
        if y >= x:
            print(i)
            break


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
c = 100
y = 0
while c < x:
    c = int(c*1.01)
    y += 1
print(y)

Solution (Python):
import sys
import math
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


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


def readstrs():
    return input().split()


X = readint()

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

print(ans)

Solution (Python):



x = int(input())
a = 100
c = 0
while a < x:
    a = int(a*1.01)
    c += 1

print(c)

Solution (Python):
import math
x = int(input(''))

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

print(y)

Solution (Python):
x = int(input())
a = 100
i = 0
while a < x:
  a = int(a*1.01)
  i += 1
print(i)

Solution (Python):
def main():
    x = int(input())
    cnt = 0
    money = 100
    while True:
        money = int(1.01 * money)
        cnt += 1
        if money >= x:
            break
    print(cnt)

if __name__ == "__main__":
    main()

Solution (Python):
a = int(input())
money = 100
year = 0
while money< a:
    
    money = money+money//100
    year += 1
print(year)

Solution (Python):
x = int(input())
ans = 0
m = 100
while True:
  ans += 1
  m += m//100
  if m >= x:
    print(ans)
    break

Solution (Python):
x = int(input())

money = 100
day = 0

while money < x:
    money += money // 100
    day += 1

print(day)

Solution (Python):
import copy
x = int(input())

tmp = 100
ans = 0

while tmp < x:
    tmp *= 1.01
    tmp= int(tmp)
    ans += 1
    

print(ans)

Solution (Python):
import math

x=int(input())
coin=100
year=0
while coin<x:
    year+=1
    coin=math.floor(coin*1.01)
print(year)

Solution (Python):
x = int(input())
year = 0
yokin = 100
while True:
    year += 1
    yokin = int(yokin * 1.01)
    if yokin >= x:
        print(year)
        break

Solution (Python):
x = int(input())
a = 1
b = 101
while b<x:
  a += 1
  b = int(b*(1.01))
print(a)

Solution (Python):
x = int(input())

money = 100
count = 0

while money < x:
    money = int(money * 1.01)
    count += 1

print(count)

Solution (Python):
import math
X = int(input())

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

Solution (Python):
x = int(input())
a = 100
i = 0
while a < x :
    a = int(a*1.01)
    i += 1
print(i)

Solution (Python):
N = int(input())
P = 100
count = 0
while P < N :
    P *= 1.01
    P //= 1
    count += 1
print(count)

Solution (Python):
x = int(input())
ans = 0
money = 100
while money < x:
    money = int(money * 1.01)
    ans += 1
print(ans)

Solution (Python):
X = int(input())
a = 100
y = 0
while True:
    a = a+a//100
    y += 1
    if a>=X:
        break

print(y)

Solution (Python):
x = int(input())
p = 100
cnt = 0
while p < x:
    cnt += 1
    p += int(p*0.01)

print(cnt)

Solution (Python):
import math

x = int(input())
money = 100
i = 0
while money < x:
    money = math.floor(money * 1.01)
    i += 1

print(i)

Solution (Python):
x = int(input())
m = 100
c = 0
while m < x:
    m *= 101/100
    m = int(m)
    c += 1
print(c)

Solution (Python):
x=int(input())
i=100
c=0
while i<x:
    i=i+(i//100)
    c=c+1
print(c)

Solution (Python):
x=int(input())
i=0
m=100
while True:
    if int(m+m*0.01)<x:
        m=int(m+m*0.01)
        i+=1
    else:
        break
print(i+1)

Solution (Python):
n = int(input())
money = 100.00
count = 0
while(True):
  money = money * 1.01
  money = int(money)
  count = count + 1
  if n <= money:
    print(count)
    exit()

Solution (Python):


def main():
     x = int(input())
     ans = 0
     base = 100

     while(True):
          ans += 1
          base = int(base * 1.01)
          if base >= x:
               print(ans)
               break

if __name__ == "__main__":
    main()

Solution (Python):
import math
X = int(input())
ans = 100
for i in range(1,1000000000000000000):
    ans = math.floor(ans * 1.01)
    if ans >= X:
        break
print(i)

Solution (Python):
x = int(input())
cnt = 0
sum = 100
while True:
    sum += int(sum*0.01)
    cnt += 1
    if sum >= x:
        break

print(cnt)

Solution (Python):
x = int(input())
a = 100
cnt = 0

while True:
    if x <= a:
        print(cnt)
        break
    a =a*101//100
    cnt += 1

Solution (Python):
import sys

X = int(sys.stdin.readline().strip())

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

Solution (Python):




if(__name__ == '__main__'):
    
    x = int(input())

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

    print(y)

Solution (Python):
import math
x=int(input())
z=100
ans=0
while z<x:
    z=math.floor(z*1.01)
    ans+=1
print(ans)

Solution (Python):
x = int(input())
dum = 100
count = 0
while(1):
    if dum >= x:
        break
    dum = dum*1.01
    dum = dum//1
    count += 1
    
print(count)

Solution (Python):
x = int(input())
now = 100
for kek in range(123123):
	if(now >=x):
		print(kek)
		exit(0)
	now = (now* 101) //100

Solution (Python):
x = int(input())
r = 0.01
s = 100
ans = 0
while s < x:
    s = int(s*(1+r))
    ans += 1
print(ans)

Solution (Python):
x = int(input())
a = 100
cnt = 0
while True:
    a += int(a*0.01)
    cnt += 1
    if a>=x:
        break

print(cnt)