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

print(ans)

Solution (Python):
N =int(input())
num=100
import math
for i in range(100000):
    num = math.floor(num*1.01)
    if num >= N:
        print(i+1)
        break

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

Solution (Python):

X = int(input())


ans = 0
y = 0
m = 100
while m < X:
    m = m + m*1//100
    y += 1


print(y)

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

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

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

Solution (Python):
import math
def main(x):
    res = 0
    t = 100
    while t < x:
        res += 1
        t += math.floor(t * 0.01)
    return res

x = int(input())
print(main(x))

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

Solution (Python):
import math

x = int(input())
count = 0
now = 100
flag = True

while flag:
  now = math.floor(now * 1.01)
  count += 1
  if now >= x:
    flag = False

print(count)

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

balance = 100
year = 0

while balance < X:
    balance += (balance * 0.01) // 1
    year += 1

print(year)

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

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

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

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

a = 100
for i in range(1, 1000000):
    a = math.floor(a * 1.01)
    if a >= x:
        print(i)
        exit()

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

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

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

tmp=100
i=0
while tmp<X:
    tmp=tmp*(1.01)//1
    i+=1

print(i)

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
INF = 10**10
MOD = 10**9 + 7
X = int(input())
d = 100
for i in range(4000):
    d = int(d * 1.01)
    if d >= X:
        print (i+1)
        exit()

Solution (Python):
import itertools
import math
import numpy as np
import fractions
from collections import deque
from itertools import combinations
from functools import reduce
from functools import lru_cache
import bisect
import sys
sys.setrecursionlimit(10**9)

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

    x = 100
    for r in range(1,1000000):
        x = math.floor(x * 1.01)
        if x >= X:
            print(r)
            exit()



if __name__ == "__main__":
  main()

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

money = 100
year = 0
while True:
  money *= ( 1 + 0.01 )
  money = math.floor( money )
  year += 1
  if money >= X:
    break
    
print( year )

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

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

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

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

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

d = 100
y = 0


while True:

    d = int(1.01 * d)
    y += 1
    
    if d >= x:
        print(y)
        exit()

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

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):
X = int(input())

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

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

s = 100
y = 0
while x > s:
    s = int(s * 1.01)
    y += 1

print(y)

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

Solution (Python):
import math
def main():
  X=int(input())
  Xtgt=100
  i=0
  sFlag=True
  while(sFlag):
    i=i+1
    Xtgt=math.floor(Xtgt*(1+0.01))
    if(Xtgt>=X):
      print(i)
      sFlag=False
  
if __name__=='__main__':
  main()

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

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

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

print(i)

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

Solution (Python):
x = int(input())
money = 100
i = 0
while (1):
    i += 1
    money += money // 100
    if money >= x:
        print(i)
        exit()

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

m = 100
ans = 1
while True:
    m = int(1.01*m)
    if m >= X:
        print(ans)
        break
    else:
        ans += 1

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

m = 100

year = 0

while m < X:
    m = int(m * 1.01)
    year += 1

print(year)

Solution (Python):
import math

X = int(input())

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

print(ans)

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

Solution (Python):
def solve(X):

    start = 100

    curr = start
    years = 0
    while curr < X:
        curr += int(0.01 * curr)
        years += 1

    return years

def iin(): return int(input())
X = iin()
print(solve(X))

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

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

y = 100
i = 0

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

print(i)

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

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

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

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

def read_int_map():
    return map(int,input().split(' '))

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

def read_s_list_loop(n):
    return [input() for _ in range(n)]
import math

X = read_int()
ans = 0
money = 100
while True:
    ans += 1
    money = math.floor(money * 1.01)
    if money >= X:
        print(ans)
        exit(0)

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

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 math

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

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

print(year)

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

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

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

Solution (Python):
from math import log,ceil
x=int(input())
ans=0
cur=100
while cur<x:
    cur*=1.01
    cur=int(cur)
    ans+=1
print(ans)

Solution (Python):
import math
x = int(input())
cnt = 0
risi=0
yokin=100
while x > yokin:
    cnt+=1
    yokin += math.floor(yokin * 0.01)
print(cnt)

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

i=0
while True:
    
    i+=1
    chokin=int(chokin*1.01)

    if chokin>=x:
        print(i)
        break

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

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

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

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

Solution (Python):
import math


def task(x):
    years = 0
    yens = 100
    while yens < x:
        yens = math.floor(yens * 1.01)
        years += 1

    print(years)


x = int(input())
task(x)

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

x = int(input())

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

print(ans)

Solution (Python):
X=input()
n=100
for i in range(1,4000):
    n=int(n*1.01)
    if X<=n:
        print i
        quit()

Solution (Python):
import math
k=int(input())
cnt=0
money=100

while True:
  cnt+=1
  money= math.floor(money*1.01)
  if money >=k:
    break
print(cnt)

Solution (Python):
from math import log,ceil
X = int(input())
i = 100
cnt = 0
while True:
    i *= 1.01
    i = int(i)
    cnt += 1
    if i >= X:
        break

print(cnt)

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

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

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

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

cnt = 0
tmp = 100
while True:
    tmp = tmp + tmp * 0.01
    tmp = int(tmp)
    cnt = cnt + 1
    if tmp >= X:
        break

print(cnt)

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

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

print(i)

Solution (Python):
if __name__ == '__main__':
    a = int(input())
    now = 100
    count = 0
    while now <a:
        count +=1
        now = int(now *1.01)
    print(count)

Solution (Python):
x = int(input())
y = 101
ans = 1
while y < x:
  y = y * 101 // 100
  ans += 1
print(ans)

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

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

Solution (Python):


x = int(input())

p = 100
y = 0
while p < x:
    p += p // 100
    y += 1

print(y)

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

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

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

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

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

print(ans)

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

i = 0
tmp = 100

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

Solution (Python):

def solve():

    X = int(input())

    i = 100
    j = 0
    while True:
        i *= 1.01
        j += 1
        i = int(i)

        if X <= i:
            print(j)
            exit()


if __name__ == "__main__":
    solve()

Solution (Python):
from sys import stdin
import math

X = float(stdin.readline().rstrip())

money = 100
year=0
while(True):
    if money>=X:
        break
    else:
        money = math.floor(money*1.01)
        year+=1
print(year)

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

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

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

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

Solution (Python):
import sys


try:
    sys.stdin = open(sys.path[0] + '\\input.txt', 'r')
    sys.stdout = open(sys.path[0] + '\\output.txt', 'w')
except FileNotFoundError:
    pass


x = int(input())

n = 100
t = 0
while n < x:
    n += (0.01 * n)
    n = int(n)
    t += 1
    

print(t)

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

y = 100
ans = 0
while y < x:
  y = (y * 101) // 100
  ans += 1
print (ans)

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

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

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

Solution (Python):
x=int(input())
cnt=0
tmp=100
while True:
    if tmp>=x:
        print(cnt)
        exit()
    cnt+=1
    tmp=int(tmp+tmp/100)

Solution (Python):
import math

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

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

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

Solution (Python):

"""
Created on Sat May  2 20:59:09 2020
"""

import sys


sys.setrecursionlimit(10 ** 9)


mod = 10**9+7

X = int(input())







m = 100
for ans in range(1,10**5):
    m += m//100

    if m >= X:
        break

print(ans)

Solution (Python):


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

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

if __name__ == '__main__':
    main()

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

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

m = 100
num = 0
while True:
    if m >= X:
        print(num)
        break
    m += int(m * 0.01)
    num += 1

Solution (Python):
import math

X=int(input())

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

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

p = 100
ans = 0
while p < X:
    p *= 101
    p //= 100

    ans += 1
print(ans)

Solution (Python):

X = int(input())

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

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

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

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

while bank < X:
    bank = (bank*1.01)//1
    count += 1

print(count)

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



'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

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

while x>a:
    a=int(a*1.01)
    cnt+=1
    
print(cnt)

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

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

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

if __name__ == '__main__':
    main()

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

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

y = 100

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

print(cnt)

Solution (Python):
from decimal import *
x = int(input())

year = 0
money = 100
while True:
    money = Decimal(money) * Decimal(1.01) // Decimal(1)
    year += 1
    if money >= x:
        print(year)
        break

Solution (Python):
X = [int(i) for i in input().split()][0]
y = 100
for i in range(1, 100000):
  y = y + int(0.01*y)
  if y>= X:
    break
print(i)

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

i=100
cnt = 0
while(x>i):
    i = int(i*1.01)
    cnt +=1

print(cnt)

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

x = ii()
y = 100

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

Solution (Python):
from math import floor

x = int(input())
ans = 0
mount = 100
while mount < x:
    mount = floor(mount * 1.01)
    ans += 1

print(ans)

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

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

Solution (Python):
from math import floor

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

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

now = 100
c = 0
while now<X:
  now += math.floor(now*0.01)
  c += 1
print(c)

Solution (Python):



X,= list(map(int, input().split()))
a=100
count=0
while(1):
  a=int(a*1.01)
  count+=1
  if(X<=a):
    print(count)
    exit()

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

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

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

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

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

Solution (Python):
x = int(input())
flag = True
start = 100
count = 0
while flag:
    count += 1
    t = int(start*1.01)
    if t>=x:
        flag = False
    start = t
print(count)

Solution (Python):
X = int(input())
C = 100
for i in range(100000):
    C += int(C*0.01)
    if C >= X:
        print(i+1)
        break

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

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

print(cnt)

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

sum=100
count=0

while sum<X:
    count+=1
    sum*=1.01
    sum=int(sum)

print(count)

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

t = 100
import math
for i in range(1, 10000):
  t = math.floor(t * 1.01)
  if t >= X:
    print(i)
    exit()

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

bank = 100
year = 0

while bank < k:
    bank = int(bank * 1.01)
    year += 1
print(year)

Solution (Python):
from math import floor

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

    bank = 100
    count = 0
    while bank < x:
        bank += floor(bank * 0.01)
        count += 1

    print(count)
    
    
resolve()

Solution (Python):
num = int(input())
list = []
money = 100
while money < num:
    money = int(money * 1.01)
    list.append(money)
print(len(list))

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

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

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

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

print(count)

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

R = 1.01
cash = 100
year = 0

while True:
    year += 1
    cash = int(cash * R)
    if cash >= X:
        print(year)
        break

Solution (Python):
import sys

input = sys.stdin.readline

x = int(input())
money = 100
for i in range(1000000):
    money += money//100
    if money >= x:
        print(i+1)
        sys.exit(0)

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

print(nen)

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

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

n=100
i=0
while n<X:
    n=int(n*101//100)
    i+=1
    
print(i)

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

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

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

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

Solution (Python):
import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
from math import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

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

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

r = 0.01
p = 100

cnt = 0
while True:
    cnt += 1
    p = int(p * (1 + r))
    if p >= X:
        break


print(cnt)

Solution (Python):
import math

X = int(input())

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

Solution (Python):

import math
X = int(input())
money = 100
count = 0
while(money < X):
    money = money + math.floor(money * 0.01)
    count+=1
print(count)

Solution (Python):
import math

x = int(input())

money = 100
year = 0

while True:
    money = math.floor(money * 1.01)
    year += 1
    if money >= x:
        break

print(year)

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

while money<X:
    year+=1
    money+=money*0.01
    money=int(money)
    

print(year)

Solution (Python):
import math
import itertools
x = int(input())
year = 0
sum = 100

while sum < x:
    sum = math.floor(sum * 1.01)
    year += 1

print(year)

Solution (Python):
import math

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

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):
import math
x = int(input())

tmp = 100

for i in range(3761):
    if tmp < x:
        tmp = math.floor(tmp * 1.01)
    else:
        print(i)
        break

Solution (Python):
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime



def input1():
	return int(input())


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


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

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	
	return fact(x+y)/fact(x)/fact(y)


def factorization(n):
	tmp=n
	count=0
	for i in range(2,int(n**0.5)+2):
		if tmp%i==0:
			cnt=0
			while tmp%i==0:
				cnt+=1
				tmp//=i
			count+=1
	if tmp!=1:
		count+=1

	return count
			




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

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

print(ans)

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

dep = 100
res = 0
while dep < x:
    dep += int(dep*0.01)
    res += 1
print(res)

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

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

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())
n = 100
ret = 0
while n < X:
  n *= 1.01
  n //= 1
  ret += 1
print(ret)

Solution (Python):
import sys
sys.setrecursionlimit(100000000)




def main():
    k = int(input())

    init = 100
    now = init
    year = 0
    while True:
        now = int(now*1.01)
        year += 1
        if now >= k:
            break
    print(year)

main()

Solution (Python):
import sys
import math
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().rstrip()

def main():
  money = 100
  X = int(input())
  ans = 0

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

if __name__ == '__main__':
  main()

Solution (Python):

import sys
import numpy as np
import math

def solve(X: int):
    p = 100
    n = 1
    while(True):
        p = math.floor(p*1.01)
        if p>=X:
            print(n)
            return
        n+=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):
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())

a=100


ma=[]
i=0
while True:
    i += 1
    a=a+math.floor(a*0.01)
    if a>=X:
        print(i)
        exit()

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

ans = 1
money = 100

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

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

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

while 1:
    cnt += 1
    amount = int(amount * 1.01)
    if amount >= x:
        break

print(cnt)

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

    while True:
        money = int(money * 1.01)
        i += 1

        if money >= x:
            print(i)
            return


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

    main(x)

Solution (Python):
import math
X=int(input())
cnt=0
n=100
while(X>n):
    n+=math.floor(n*0.01)
    cnt+=1
print(cnt)

Solution (Python):

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

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

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

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

num=100

rate=1.01
count=1

while(1):
    num=int(num*rate)
    if(num>=x):
        print(count)
        exit()
    count+=1

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

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

Solution (Python):
A = 100
X = int(input())
ans = 0

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

print(ans)

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

Solution (Python):


import sys
import math
import collections
import itertools
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.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)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")

X = I()

a = 100
for i in range(INF):
    if a >= X:
        print(i)
        break

    a = int(a * 1.01)

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

start = 100
count = 1
while True:
    start *= 1.01
    start = int(start)

    if start >= X:
        print(count)
        break
    count += 1

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

Solution (Python):
x = int(input())
cur = 100
for i in range(1000000):
    if cur >= x:
        print(i)
        break
    cur *= 1.01
    cur = int(cur)

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

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


iim = lambda: map(int, input().rstrip().split())

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

    n = 0
    y = 100
    while True:
        if y >= x:
            print(n)
            return

        n += 1
        y = int(y*1.01)

if __name__ == "__main__":
    resolve()

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

year = 0
sum = 100
while (X > sum):
    sum += int(sum * 0.01)
    year += 1

print(year)

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

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

st = 100
for i in range(100000000):
    t = int(st * 1.01)
    if t >= x:
        print(i+1)
        break
    else:
        st = t

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