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):
x =int(input())
m = 100
ans = 0
while (m < x):
    m = m * 1.01
    m = int(m)
    ans += 1
print(ans)

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

Solution (Python):
import math
may = 100
a = int(input())
ans = 0
while a > may:
    may = math.floor(may * 1.01)
    ans += 1
print(ans)

Solution (Python):
x=int(input())
count=0
yokin=100
while True:
  count+=1
  yokin=yokin*101//100
  if x <= yokin:
    print(count)
    break

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

Solution (Python):
import math

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

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

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

y = 0
M = 100

while (M < N):
    y += 1
    M *= 1.01
    M = int(M)

print(y)

Solution (Python):

from collections import deque
from operator import itemgetter
from bisect import bisect_left, bisect
import itertools
import sys
import math
import numpy as np
import time
sys.setrecursionlimit(10**6)
input = sys.stdin.readline


def main():
    x = float(input())
    price = 100.0
    cnt = 0
    while (price < x):
        price *= 1.01
        price = math.floor(price)
        cnt += 1
    print(cnt)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
t = 100
ans = 0

while t < x:
    t = t * 1.01 //1
    ans += 1

print(ans)

Solution (Python):
'''
from math import log10
p = 100
import math
a = int(input()) 
t = math.ceil(log10(a/p)/log10(1.01))
print(t)
'''
p = 100
t = 0
a = int(input()) 
import math
while True:
	it = p * 0.01
	if it < 1:
		it = 0
	p+=math.floor(it)
	t +=1
	
	if p>= a:
		break
print(t)

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

Solution (Python):
n = int(input())
count = 0
money = 100

while(money < n):
    count += 1
    money *= 1.01 
    money = money // 1
print(count)

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

v=100
for i in range(5000):
    v = int(v*1.01)
    if v >= X:
        break
print(i+1)

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

Solution (Python):
import math

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

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

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

Solution (Python):
import math
x = int(input())
total=100
ans=0

while x>total:
    a=math.floor(total*0.01)
    total += a
    ans+= 1
print(ans)

Solution (Python):
import math
X = int(input())
b = 100
r = 0
for i in range(10**18+1):
    b = math.floor(b*1.01)
    r += 1
    if b >= X:
        print(r)
        break

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

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

Solution (Python):
X = int(input())
m = 100
y = 0

while m < X:
    m += m // 100
    y += 1

print(y)

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())
nen = 1
tyotiku = 100

while tyotiku * 1.01 < x:
    nen += 1
    tyotiku = (tyotiku*1.01)//1

print(nen)

Solution (Python):
X = int(input())
t = 100
i = 1

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

Solution (Python):
X = int(input())
M = 100
yr = 0

while X>M:
  M = int(M*1.01)
  yr = yr+1
print (yr)

Solution (Python):

import math
x = int(input())

i = 0
a = 100
while a < x:
    a *= 1.01
    a = math.floor(a)
    i += 1
print(i)

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

n = 100
i = 1
while True:
    n = int(n * 0.01 + n)
    if X <= n:
         print(i)
         break
    i+=1

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

i=0
total=100
while(1):
    if (total>=x):
        print(i)
        exit()
    total = int(total * 1.01)
    i+=1

Solution (Python):
X=int(input())
money=100
for y in range(4000):
    z=y+1
    R=int(money/100)
    money+=R
    if X<=money:
        break
print(z)

Solution (Python):
X = input()

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

print c

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

ans=0
A=100
while A<x:
    if A>=x:
        break
    ans+=1
    A=(A*1.01)//1

print(ans)

Solution (Python):
from math import log
from math import ceil

x = int(input())

left = 1
right = 3760


while right - left != 1:
    mid = (right + left) // 2
    money = 100
    for i in range(mid):
        money = int(money * 1.01)
    if money >= x:
        right = mid
    else:
        left = mid
print(right)

Solution (Python):






import sys,bisect,math
sys.setrecursionlimit(15000)

X = int(sys.stdin.readline())
a = 100.0
n = 0
while X > a:
    a *= 1.01
    a = math.floor(a)
    n += 1
print(n)

Solution (Python):
import math
m = 100
count = 0
x = int(input())
while(1):
    m = math.floor(m*1.01)
    count += 1
    if m >= x:
        print(count)
        break

Solution (Python):
import math

X = int(input())

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

Solution (Python):
import math
x = int(input())
a = 1
b = 100
for i in range(3760):
  b=math.floor(b*1.01)
  if b<x:
    a += 1
  else:
    print(a)
    break

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

Solution (Python):
x = int(input())
amt, i = 100,0
while amt < x:
	amt = amt + int(0.01 * amt)
	i += 1
print(i)

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

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

Solution (Python):

import sys
import math

def solve(X: int):
    current = 101
    now = 1
    while True:
        if current >= X:
            print(now)
            break
        current = math.floor(current*1.01)
        now+=1
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    solve(X)

if __name__ == '__main__':
    main()

Solution (Python):
x=int(input())
a=100
for i in range(1, 10**18):
  a *= 1.01
  a =int(a)
  if x <= a:
    print(i)
    break

Solution (Python):
X=int(input())
A=100
count=0
for i in range(10**11):
    A=(A*101)//100
    count+=1
    if X<=A:
        print(count)
        exit()
    else:
        pass

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

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

for i in range(10**18):
    a*=1.01
    a=math.floor(a)
    if a>=X:
        print(i+1)
        break

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

  year = 0

  d = 100

  while X>d:
    d = int(d*1.01)
    year+=1

  print(year)


if __name__ == "__main__":
  main()

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

while t < X:
  t = t*1.01//1
  cnt += 1

print(cnt)

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

Solution (Python):
import math

x = int(input())

tmp = 100
year = 1

while True:
    if tmp*1.01 >= x:
        print(year)
        exit()
    tmp = int(1.01*tmp)
    year += 1

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

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

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

Solution (Python):
import math
def fu(x):
  return math.floor(x*1.01)
a=100
cnt=0
x=int(input())
while a<x:
  cnt+=1
  a=fu(a)
  
print(cnt)

Solution (Python):
x = int(input())
i = 100
ans = 0

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

print(ans)

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

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

from collections import defaultdict
from sys import exit
import math


def main():
    n = getN()
    x = 100
    for i in range(10000):
        x = math.floor(x * 1.01)
        if x >= n:
            print(i + 1)
            return
if __name__ == "__main__":
    main()

Solution (Python):
goal = int(input())
now = 100
interest = 0.01
time= 0

while(True):
  
  now += int(now*0.01)
  time+=1
 
  
  if now >= goal:
    break
    
    
print(time)

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

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

Solution (Python):
import math

x = int(input())
m = 100
r = 1.01

c = 0
while True:
    c += 1
    m = math.floor(m * r)
    if (m >= x):
        break

print(c)

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

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

print(y)

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

Solution (Python):
import math

X = int(input())
sum = 100
n = 0

while sum < X:
    sum = math.floor(sum * 1.01)
    n += 1

print(n)

Solution (Python):
s = 100
n = int(input())
for i in range(1, 10**5):
    s += s // 100
    if s >= n:
        print(i)
        break

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

print(year)

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

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

k=100
for i in range(10000):
    if k >= x:
        print(i)
        break
    k= k*1.01 // 1

Solution (Python):


def main():
    x = int(input())
    money = 100
    year = 0

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

    print(year)


if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

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

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

print(i)

Solution (Python):
import math

x = int(input())

total = 100
count = 0
while True:
    count += 1
    total = math.floor(total * 1.01)
    if x <= total:
        break

print(count)

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

init = 100.
budjet = int(init * 1.01)
year = 1
while budjet < X:
  budjet =  int(budjet * 1.01)
  year = year + 1
  
print(year)

Solution (Python):
import sys
import math
from collections import deque
import heapq
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()

n = 100
ans = 0
while n < N:
  n += int(n*0.01)
  ans += 1
print(ans)

Solution (Python):
x=int(input())
ans = []
ans.append(100)
i = 0
while True:
    ans.append(int(ans[i]*1.01))
    i += 1
    if ans[i] >= x:
        break
print(i)

Solution (Python):
years = 0
x = int(input())
ans = 100

while ans < x:
    ans = int(ans * 101 / 100)
    years += 1 

print(years)

Solution (Python):
import math

x = int(input())

a = 100

n = 0

while True:
    if a >= x:
        print(n)
        exit()

    a = math.floor(a * 1.01)
    n = n+1

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



A = 100
num = 1

while True:
  A = math.floor(A * 1.01)
  if A >= X:
    print(num)
    sys.exit()
  
  num += 1

Solution (Python):
import math
from collections import Counter
k=int(input())
p=100
c=0
while True:
	p+=int(p*0.01)
	c+=1
	if p>=k:
		break
print(c)

Solution (Python):
import math

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

Solution (Python):
import math
x=int(input())
ans=100
for n in range(1,10**5+1):
    ans *= (1.01)
    ans = math.floor(ans)
    if ans>=x:
        print(n)
        exit()

Solution (Python):
import math

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

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

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

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

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

money = 100
count = 0
while True:
    if money >= x:
        print(count)
        break
    else:
        count += 1
        money += (money*0.01)//1

Solution (Python):
import math

n = int(input())

cash = 100
count = 0

while n > cash:
    cash = cash + math.floor(cash * 0.01)
    count += 1

print(count)

Solution (Python):
N=int(input())
a=True
b=100
ans=0
while a==True:
    b=b*1.01//1
    ans=ans+1
    if b>=N:
        print(ans)
        break
    else:
        pass

Solution (Python):
import math

inp = [input() for i in range(1)]
target = int(inp[0])

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

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

yokin = 100
count = 0

while yokin <  X:
    count += 1
    risi = math.floor(yokin * 0.01)
    yokin = yokin + risi
    
print(count)

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

if __name__ == '__main__':
    X = int(input())
    main(X)

Solution (Python):
import math

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

Solution (Python):
import math
kane = 100
X = int(input())
i = 1
while (i):
    kane = math.floor(kane * 1.01)
    if X <= kane:
        print(i)
        exit()
    i += 1

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

Solution (Python):
n,change=int(input()),100
year=0
while change < n:
  change*=1.01
  change=int(change)
  year+=1
print(year)

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

while True:
  money = int(money*1.01)
  
  if money>= x:
    break
  n+=1

print(n)

Solution (Python):




x = int(input())


idx = 0
amount = 100

while amount < x:
    amount = int(amount * (1 + 0.01))
    idx = idx + 1

ans = idx


print(ans)

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())
money = 100
answer = 0
while money < X:
    money = int(money + money*0.01)
    answer += 1
print(answer)

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

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

yen = 100

for i in range(3761):
    if X <= yen:
        print(i)
        exit()
    yen += yen // 100

Solution (Python):
import math
x = int(input())
d = 100
i = 0
while x > d:
    d = math.floor(d*1.01)
    i += 1
print(i)

Solution (Python):
import math
X= int(input())
ans = 0
get = 100.0
while  X > get:
    ans += 1
    get += math.floor(get*0.01)

print(ans)

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

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

Solution (Python):
X = int(input())
a=100
for i in range(10**5):
    a = a*101//100
    if a>=X:
        print(i+1)
        break

Solution (Python):
import math

X = int(input())

base = 100
rate = 1.01
year = 1

while True:
    base = math.floor(base) * rate
    if base > X:
        print(year)
        break
    year += 1

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

L = 100
n = 0

while L < X:
    if L >= X:
        break
    else:
        L = int(L*1.01)
        n +=1

print(n)

Solution (Python):
from math import ceil,floor

a = 100
x = int(input()) 
cnt = 0

while True:
  cnt = cnt + 1
  a = floor(a * 1.01)
  if a >= x:
  	break
print(cnt)

Solution (Python):
import math

X = int(input())

total = 0
a = X

while a > 100:
    a = math.ceil(a * 100 / 101)
    while a - 1 + ((a - 1) // 100) >= X:
        a = a - 1
    total += 1

print(total)

Solution (Python):
X=int(input())
C=0
M=100

while X>M:
  M=int(M+M*0.01)
  C+=1

print(C)

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

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
count=0

while a<X:
  a=int(a+(a*0.01))
  count=count+1

print(count)

Solution (Python):
def main():

    from bisect import bisect_left as bl, bisect_right as br, insort
    import sys,heapq,math
    from collections import defaultdict as dd, deque
    def data(): return sys.stdin.readline().strip()
    def mdata(): return list(map(int, data().split()))
    out = sys.stdout.write
    
    INF = int(1e9)
    mod = int(1e9)+7

    x=int(data())
    p=100
    cnt=0
    while p<x:
        p+=p//100
        cnt+=1
    print(cnt)



if __name__ == '__main__':
    main()

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

Solution (Python):
import math

X = int(input())
money = 100
sum = 100
count_year = 0

while sum < X:
    interest = math.floor(sum / 100)
    sum = sum + interest
    count_year += 1

print(str(count_year))

Solution (Python):
import math

x = int(input())



ans = 0
d = 100
r = 1.01

while True:
  ans += 1
  d = math.floor(d * r)
  
  if d >= x:
    break
print(ans)

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

money = 100
year = 0
while money <= x:
    if money == x:
        break
    
    year += 1
    money += money*0.01
    money = int(money)
    
print(year)

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

a=100
b=0
while a<x:
  b=b+1
  a=(a*1.01)//1
  
print(b)

Solution (Python):
import sys

lines = 1
inp = list()

for _ in range(lines):
    inp.append(sys.stdin.readline().strip())


x = int(inp[0])

c = 100
count = 0

while x > c:
    count += 1
    c = int(1.01 * c)

print(count)

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

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

Solution (Python):
import sys
import math
X = int(input())
i = 1
k = int(100*1.01)
while 1:
  if X <= k:
    break
  k = int(k * 1.01)
  i += 1
  
print(i)

Solution (Python):
x = int(input())
y = 100
ans = 0
for i in range(1,10000):
	y = (y*101)//100
	if (y>=x):
		ans = i
		break

print(ans)

Solution (Python):
import math
x=int(input())
m=100
n=0
f=0
while f==0:
    if m>=x:
        f+=1
        print(n)
    else:
        m+=math.floor(m/100)
        n+=1

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

f = 100
c = 0
while f < x:
    f = int(f*1.01)
    c += 1
print(c)

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

Solution (Python):
def bank(p):
    return p + p/100

a = int(input())
p = 100
c = 0
while p < a:
    c+=1
    p = bank(int(p))
print(c)

Solution (Python):
x = int(input())
amt = 100
t = 0
while(amt < x):
    amt += int(0.01 * amt)
    t += 1
print(t)

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

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

Solution (Python):
target = int(input())
import math 
current = 100
years = 0
while True:
  years += 1
  interest = math.floor(current * 0.01)
  current = current + interest
  if current >= target:
    print(years)
    break

Solution (Python):
import math
a=int(input())
money = float(100)
for i in range(10000):
  money = math.floor(money*1.01)
  if money >= a:
    print(i+1)
    exit()

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())

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

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



'''


a = int(input())

b, c = map(int, input().split())

s = input()

print('{} {}'.format(a+b+c, s))
'''

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

a=[]
a.append(100)
i=0
while a[i]<X:
    a.append(a[i]+int(0.01*a[i]))
    i +=1
    
print(i)

Solution (Python):
def main():
    x = int(input())
    money = 100
    count = 0

    if x <= money:
        print(count)
    else:
        while True:
            money_add = int(money * 0.01)
            money = money + money_add
            count += 1
            if x <= money:
                break
        print(count)


if __name__ == "__main__":
    main()

Solution (Python):
def risoku(x):
  return int(x * 1.01)

X = int(input())


x = 100
i = 0
while True:
  x = risoku(x)
  i += 1
  if X <= x:
    print(i)
    break

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

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]

X = I()

a = 100
y = 1

while True:
    a += a // 100
    if a >= X:
        print(y)
        break
    y += 1

Solution (Python):
X = int(input())
xa = 100
for i in range(1,5000):
    xb = xa
    xa = int(xb*1.01)
    if xa >= X:
        print(i)
        exit()

Solution (Python):

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

Solution (Python):
import math

x = int(input())

a = 100

for i in range(1000000000):
    a += math.floor(a*0.01)
    if a>=x:
        print(i+1)
        break

Solution (Python):




def main():
    x = int(input().strip())
    n = 0
    a = 100
    while a < x:
        a += int(a * 0.01)
        n += 1
    print(n)

if __name__ == '__main__':
    main()

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

a = 100
count =0

while a < x:
    intr = math.floor(a*0.01)
    a = a + intr
    count += 1
print(count)

Solution (Python):
import math
from sys import stdin


def get_result(data):
    N = data[0]
    cnt = 0
    val = 100
    while N > val:
        val = math.floor(val * 1.01)
        cnt += 1
    return cnt


if __name__ == '__main__':
    data = list(map(int, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

Solution (Python):
import math
X = int(input())
amount = 100
year = 1
while True :
    amount = amount + math.floor(amount*1/100)
    if amount >= X :
        print(year)
        break
    year += 1

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

Solution (Python):
def solution():
    x = int(input())
    year = 0
    st = 100
    while True:
        if x <= st:
            print(year)
            return
        st += int(st * 0.01)
        year += 1

solution()

Solution (Python):
import math

x = 0

def format_input(filename = None):
	global x
	if filename == None:
		x = int(input())

	elif filename == '__random__':
		from random import randint as rng
		x = rng(101, 10**18)
		print(x)

def get_answer():
	answer = 0
	deposit = 100
	while deposit < x:
		deposit = deposit + deposit // 100
		answer += 1
	return answer

if __name__ == '__main__':
	format_input()

	ans = get_answer()
	print(ans)

Solution (Python):
import math
p = 100
f = int(input())
i =0
while p < f:
    p = p * 1.01
    p = math.floor(p)
    i+= 1
print(i)

Solution (Python):
x = int(input())
ans = 0
sto = 100

while sto < x:
    sto = sto*1.01//1
    ans += 1

print(ans)

Solution (Python):
import math

X = int(input())

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

print(ans)

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

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

a=100
i=0
while True:
    if a>=x:
        print(i)
        exit()
    else:
        a+=int(a*0.01)
        i+=1

Solution (Python):
X = int(input())
mon = 100
n = 0
while True:
  if mon >= X:
    print(n)
    break
  mon = int(mon*1.01)
  n += 1

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

i = 1
p = 100

while True:
  p = int(p*(1.01))
  if p >= x:
    break
  i += 1

print(i)

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

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

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

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

Solution (Python):
import sys

x = int(sys.stdin.readline().rstrip())
mon = 100
year = 0

while True:
    year += 1
    mon = int(mon * 1.01)
    if mon >= x:
        break

print(year)

Solution (Python):
import math
X = int(input())
now_money = 100
for i in range(1,3762):
  now_money += math.floor(now_money*0.01)
  if now_money >= X:
    print(i)
    exit()

Solution (Python):
a = int(input())
counter =0
fee = 100

while(True):
  fee = int(fee*1.01)
  counter+=1
  if fee >= a:
    break

print(counter)

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

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

Solution (Python):
import numpy as np
import math
X=int(input())
tmp=100


for i in range(6000):
  tmp=int(tmp*1.01)
  if(tmp>=X):
    print(i+1)
    break

Solution (Python):
X = int(input())
mon = 100
ans = 0
while mon < X:
  mon *= 101; mon //= 100;
  ans += 1
print(ans)

Solution (Python):

def main():
    X = int(input())
    money = 100
    year = 0
    while True:
        money = money * 1.01
        money = int(money)
        year += 1
        if money >= X:
            print(year)
            return

if __name__ == '__main__':
    main()

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

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

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

ans = 0

pre_yokin = 100
yokin = 100

while(yokin < n):

    yokin = math.floor(pre_yokin*1.01)
    pre_yokin = yokin
    ans += 1

print(ans)

Solution (Python):
import sys

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()

x = int(input())

p = 100
year = 0
while p<x:
  p = p*(1.01)
  p //= 1
  year += 1
print(year)

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

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

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

a = 100
for i in range(10**18):
    if x > a:
        a *= 1.01
        a = int(a)
        continue
    else:
        print(i)
        break

Solution (Python):
def main():
    X = float(input())
    yen = 100
    rishi = 0.01
    year = 0

    while(yen < X):
        year += 1
        yen = yen + int(yen * rishi)
    print(year)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
X = int(input())
a = 100
for i in range(100000):
    a = int(a * 1.01)
    if a >= X:
        print(i+1)
        exit()

Solution (Python):
X = int(input())
ans = 1
t = 100

while True:
  t = int(1.01 * t)
  
  if t >= X:
    print(ans)
    exit()
    
  ans += 1

Solution (Python):

"""
=int(input())
=map(int,input().split())
=list(map(int,input().split()))








lis=[[] for _ in range(M)]
for i in range(M):
    lis[i] = list(map(int,input().split()[0:]))


N = int(input())
a = [0] * N
b = [0] * N
c = [0] * N
for i in range(N):
    a[i], b[i], c[i] = map(int, input().split())
"""
import math
x=int(input())
count=0
k=100
for i in range(100000):
    k=math.floor(k*1.01)
    count+=1
    if k>=x:
        break
print(count)

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

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

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

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

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

X = input_int()
now = 100
ans = 0

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

print(ans)

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


















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

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