CodeEff/ECCO huggingface dataset:
# Original solution
N = int(eval(input()))
H = list(map(int,input().split()))
ans = 0
for i in range(N-1):
  if(H[i] > H[i+1]):
    ans += H[i] - H[i+1]
print((ans + H[-1]))

# Optimized solution
def ans():
  N = int(eval(input()))
  H = list(map(int,input().split()))
  res = 0
  for i in range(N-1):
    if(H[i] > H[i+1]):
      res += H[i] - H[i+1]
  print((res + H[-1]))
ans()
# Original solution
N = int(eval(input()))
h = list(map(int, input().split()))
board = [[0] * (N + 1) for _ in range(max(h))]
for i in range(N):
    for j in range(h[i]):
        board[j][i + 1] = 1
print((sum(row[i] == 0 and row[i + 1] == 1 for row in board for i in range(N))))


# Optimized solution
eval(input())
ans, tmp = 0, 0
for h in map(int, input().split()):
    ans += max(0, h - tmp)
    tmp = h
print(ans)
# Original solution
import sys

input = sys.stdin.readline

ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

n = ri()
ls = ril()

prev = 0
up = True
res = 0
for x, y in zip(ls, ls[1:] + [0]):
    if up and x > y:
        res += x - prev
        up = False
    elif not up and x < y:
        prev = x
        up = True
print(res)

# Optimized solution
import sys

input = sys.stdin.readline

ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

n = ri()
ls = ril()

res = 0
for x, y in zip([0] + ls, ls):
    if x < y:
        res += y - x
print(res)
# Original solution
N=int(eval(input()))
A=list(map(int,input().split()))

maxh=max(A)
ans=0
for i in range(1,maxh+1):
  # i 以上の高さのブロック数をカウントする
  block=0
  cur=False
  if A[0]>=i:
    block+=1
    cur=True
  for j in range(1,len(A)):
    if A[j]>=i:
      if not cur:
        block+=1
        cur=True
    else:
      cur=False
  ans+=block

print(ans)


# Optimized solution
N=int(eval(input()))
A=list(map(int,input().split()))
cur=0
ans=0
for i in range(N):
  if A[i]>cur:
    ans+=A[i]-cur
  cur=A[i]
print(ans)
# Original solution
'''
数列hを棒グラフと見て
0と0で挟まれた山の個数を数える→すべて-1して山を削っていく
出力例２なら
[3 1 2 3 1]をmax(h)回，-1ずつ減らしていく
[2, 0, 1, 2, 0]
[1, 0, 0, 1, 0]
[0, 0, 0, 0, 0]
0になると花に水をやってはいけないから
count0でその花が何番目にあるか，を取得
数列count0で前項との差が1より大きければ山がある＝水をかけれる
'''
n=int(eval(input()))
h=list(map(int, input().split()))
sum=0
for i in range(max(h)):
    if 0 not in h:
        h=[X-1 if X>0 else 0 for X in h]
        sum+=1
        # print(h,1)
    else:
        count0=[Y for Y, Z in enumerate(h) if Z==0]
        a=count0.copy()
        b=count0.copy()
        del a[0]
        del b[-1]
        c=[x-y for(x,y) in zip(a,b)]
        sum = sum + len(c)-c.count(1)
        if count0[0]>0 and count0[-1]<n-1:
            sum +=2
        elif count0[0]>0 or count0[-1]<n-1:
            sum +=1
        else:
            sum +=0
        h=[i-1 if i>0 else 0 for i in h]
print(sum)


# Optimized solution
n,*h=list(map(int,open(0).read().split()))
a=h[0]
for i in range(1,n):
    if h[i-1]<h[i]:
        a+=h[i]-h[i-1]
print(a)
# Original solution
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())

# 方針
# 前から順に-1していく
# その際、常に前の数を見ておき、0になった場合一区切り
# カウンターを+1する
# また、最後の項に達したときも+1
# インデックスは先頭に戻して
# 全ての項が0になるまで繰り返す
# （全部0になったことを確認するため、初めにsumを取って
# 引き算するたびにsumも-1していき、0になったらループ脱出）

def main():
  n=I()
  l=LI()

  sm=sum(l)

  i=0
  c=0
  while True:

    # print(l)
    # print(c)

    if l[i]!=0:
      l[i]-=1
      sm-=1

      if i==n-1 or l[i+1]==0:
        c+=1

    i+=1
    if i>=n:
      i=0

      if sm==0:
        break

  return c

print((main()))


# Optimized solution
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())

def main():
  n=I()
  l=LI()

  sm=sum(l)

  c=0
  i=0
  while True:
    if l[i]>0:
      l[i]-=1
      sm-=1

      if i+1==n or l[i+1]==0:
        c+=1

    i+=1
    if i>=n:
      i=0

    if sm==0:
      return c

print((main()))
# Original solution
N = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
for i in range(max(h)):
    h.append(0)
    count = 0
    for k in range(N):
        if h[k] != 0 and h[k + 1] == 0:
            count += 1
    ans += count
    h = list([(x - 1, 0)[x == 0] for x in h])
print(ans)

# Optimized solution
N = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
count = 0
h.append(0)
f = set(h)
for i in range(max(h)):
    if i in f:
        count = 0
        for k in range(N):
            if h[k] != 0 and h[k + 1] == 0:
                count += 1
    ans += count
    h = list([(x - 1, 0)[x == 0] for x in h])
print(ans)
# Original solution
n=0
Answer=0
N=int(eval(input()))
h=list(map(int,input().split()))
h.insert(0,0)

for i in range(N):
    if h[n]<=h[n+1]:
        m=h[n+1]-h[n]
        Answer=Answer+m
    else :
        pass
    n=n+1
print(Answer)

# Optimized solution
N=int(eval(input()))
h=list(map(int,input().split()))
Answer=h[0]
 
for i in range(N-1):
    if h[i]<=h[i+1]:
        m=h[i+1]-h[i]
        Answer=Answer+m
        
print(Answer)
# Original solution
n = int(eval(input()))
H = [int(i) for i in input().split()]

count = 0
for _ in range(100):
    flag = 1
    for i in range(n):
        if H[i] > 0:
            H[i] -= 1
            if flag:
                count += 1
                flag = 0
        else:
            flag = 1
            
print(count)

# Optimized solution
n = int(eval(input()))
A = [0] + [int(i) for i in input().split()]
cnt = 0
for i in range(n):
    if A[i + 1] > A[i]:
        cnt += A[i + 1] - A[i]
print(cnt)
# Original solution
N = int(eval(input()))
h = list(map(int,input().split()))
if h == [0]*N:
    print((0))
    exit()
for i in range(1,10001):
    f = False
    for j in range(N):
        if h[j] > 0:
            h[j] -= 1
            f = True
        elif h[j] <= 0 and f:
            break
    if h == [0]*N:
        ans = i
        break
print(ans)

# Optimized solution
N = int(eval(input()))
H = list(map(int,input().split()))
cnt = 0
for _ in range(10**4):
    if any(H) is False:
        break
    cnt += 1
    f = False
    for i in range(len(H)):
        if H[i] > 0:
            H[i] -= 1
            f = True
        elif f and H[i] == 0:
            break
print(cnt)
# Original solution
from sys import stdin
from itertools import groupby

n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
li = [0] + li
zantei = 0
point = 0
for i in range(len(li)):
    if li[i-1] <= li[i]:
        point += li[i]-li[i-1]

print(point)

# Optimized solution
n = int(eval(input()))
h = list(map(int,input().split()))

point = 0

now = 0

for i in h:
    if now <= i:
        now,point = i,point+(i-now)
    else:
        now = i

print(point)
# Original solution
def calc(a,n):
    array = [[a[j]>i  for j in range(n)] for i in range(max(a))]
    mat = [[a for a,b in zip(row,row[1:]+[False]) if a and a!=b]for row in array]
    return sum([len(row)for row in mat])
n = int(eval(input()))
a = [int(e) for e in input().split()]

print((calc(a,n)))

# Optimized solution
n = int(eval(input()))
a = [int(e) for e in input().split()]
tmp_mat = [[a[j]>i  for j in range(n)] for i in range(max(a))]
mat = [[a for a,b in zip(row,row[1:]+[False]) if a and a!=b]for row in tmp_mat]
print((sum([len(row)for row in mat])))
# Original solution
N = int(eval(input()))

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

flowers = [0] * N

start = 0
end = 0

con = 0

while flowers != H:
	for i in range(0,N):
		if H[i] > flowers[i]:
			start = i
			for j in range(i,N):
				if H[j] == flowers[j]:
					end = j
					break
				else:
					end = N
			break


	for k in range(start,end):
		flowers[k] += 1
	con += 1
	start = 0
	end = 0
	
	


print(con)

# Optimized solution
N = int(eval(input()))
L = list(map(int,input().split()))
s = L[0]
ans = s
for i in range(0,N):
  if s <= L[i]:
    ans += L[i] - s
  s = L[i]

print(ans)
# Original solution
n=int(eval(input()))

h=[int(x) for x in input().split()]

height=[]

result=0
tmp=0

for i in range(max(h)):
    buf=[]
    for j in range(n):
        if h[j] > i:
            buf.append(1)
        else:
            buf.append(0)
    height.append(buf)

for val in height:
    while(tmp < len(val)):
        if val[tmp]==0:
            tmp+=1
        else:
            result+=1
            while(tmp<len(val)):
                if(val[tmp]==0):
                    break
                tmp+=1;
    tmp=0
#print(height)
print(result)

# Optimized solution
n=int(eval(input()))
h=[int(x) for x in input().split()]
buf=[0 for i in range(n)]

ans=0

flag=False

for i in range(max(h)):
    for j in range(n):
        if h[j] >= i+1:
            flag=True
        if flag and h[j] <= i:
            ans+=1
            flag=False
    if flag:
        ans+=1
        flag=False

print(ans)
# Original solution
def main():
    import sys
    input = sys.stdin.readline
    a = int(input().rstrip('\n'))
    s = str(input().rstrip('\n'))
    if a >= 3200:
        print(s)
    else:
        print("red")


if __name__ == '__main__':
    main()


# Optimized solution
def slove():
    import sys
    input = sys.stdin.readline
    a = int(input().rstrip('\n'))
    s = str(input().rstrip('\n'))
    print((s if a >= 3200 else "red"))


if __name__ == '__main__':
    slove()
# Original solution
import decimal
X = int(eval(input()))
i = 0
K = 100

while K < X:
  i = i + 1
  K_ = decimal.Decimal(str(K*1.01))
  K = int(K_.quantize(decimal.Decimal('0'), rounding=decimal.ROUND_FLOOR))
  
print(i)

# Optimized solution
X = int(eval(input()))
i = 0
K = 100
 
while K < X:
  i = i + 1
  K = int(K*1.01)
  
print(i)
# Original solution
import sys
input = sys.stdin.readline
from collections import *

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

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

print(ans)

# Optimized solution
X = int(eval(input()))
now = 100
ans = 0

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

print(ans)
# Original solution
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import floor
from decimal import Decimal

def main():
    x = int(eval(input()))
    n = Decimal(100)
    r = 0
    while n < x:
        n = Decimal(floor((n * Decimal(101) / Decimal(100))))
        r += 1
    print(r)

if __name__ == '__main__':
    main()

# Optimized solution
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import floor
from decimal import Decimal

def main():
    x = int(eval(input()))
    n = Decimal(100)
    r = 0
    while n < x:
        n = Decimal(floor((n * 101 / 100)))
        r += 1
    print(r)

if __name__ == '__main__':
    main()
# Original solution
from math import floor

def main():
    X=int(eval(input()))
    tmp=100
    for year in range(1,4000):
        tmp += tmp//100
        if tmp >= X:
            print(year)
            exit()

main()


# Optimized solution
def main():
    X=int(eval(input()))
    tmp=100
    for year in range(1,4000):
        tmp += tmp//100
        if tmp >= X:
            print(year)
            exit()
main()
# Original solution
from sys import exit

def main():
    X = int(eval(input()))
    deposit = 100

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

        if deposit >= X:
            print(i)
            exit()

if __name__ == '__main__':
    main()

# Optimized solution
# from sys import exit

def main():
    x = int(eval(input()))
    d = 100
    ans = 0
    
    while d < x:
        d = int(d*1.01)
        ans += 1
    print(ans)

if __name__ == '__main__':
    main()
# Original solution
import math
x = int(eval(input()))
a = 100

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


# Optimized solution
x = int(eval(input()))
a = 100
ans = 0
while (a < x):
    a += a//100
    ans+=1
print(ans)
# Original solution
x=int(eval(input()))
n=100
cnt=0
while n<x:
    cnt+=1
    n*=101
    n//=100
print(cnt)

# Optimized solution
x=int(eval(input()))
n=100
cnt=0
while n<x:
    cnt+=1
    n+=n//100
print(cnt)
# Original solution
from math import floor,ceil
X = int(eval(input()))
 
p = 100
c = 0
while p < X:
    p=floor(p*1.01)
    c += 1
print(c)

# Optimized solution
from math import floor,ceil
X = int(eval(input()))
cash = 100
count = 0
while cash < X:
    cash=floor(cash*1.01)
    count += 1
print(count)
# Original solution
X = int(eval(input()))
 
a = 100
i = 0
while a < X:
  a += a // 100
  i += 1

print(i)

# Optimized solution
X = int(eval(input()))

# 割り算をして切り下げるときは a // b が良い！
a = 100
i = 0
while a < X:
  a += a // 100
  i += 1

print(i)
# Original solution
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))

x = int(eval(input()))

yokin = 100

for i in range(1, 100000000000):
    yokin *= 101
    yokin = yokin //100
    if (yokin >= x):
        print(i)
        break


# Optimized solution
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))

x = int(eval(input()))

yokin = 100

for i in range(1, 100000000000):
    yokin += yokin // 100
    if (yokin >= x):
        print(i)
        break
# Original solution
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

# sys.setrecursionlimit(100000)
input = sys.stdin.buffer.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


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


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X):
    T = 100
    for i in range(INF):
        T *= 1.01
        T = int(T)
        if X <= T:
            return i + 1


def main():
    X = read_int()
    print(slv(X))


if __name__ == '__main__':
    main()


# Optimized solution
# -*- coding: utf-8 -*-
INF = 2**62-1


def read_int():
    return int(eval(input()))


def slv(X):
    T = 100
    for i in range(INF):
        T += T // 100
        T = int(T)
        if X <= T:
            return i + 1


def main():
    X = read_int()
    print((slv(X)))


if __name__ == '__main__':
    main()
# Original solution
import math
from decimal import Decimal
X = int(eval(input()))
now = 100
year = 0

while True:
    if now >= X:
        break
    #now = int(now * Decimal("1.01"))
    now = int(now * round(Decimal(1.01), 2))
    year += 1

print(year)


# Optimized solution
import math
from decimal import Decimal
X = int(eval(input()))
now = 100
year = 0

while True:
    if now >= X:
        break
    #now = int(now * Decimal("1.01"))
    #now = int(now * round(Decimal(1.01), 2))
    now += now // 100

    year += 1

print(year)
# Original solution
n = 0
m = 100
X = int(eval(input()))
while m < X:
    m += (m // 100)
    n += 1
print(n)


# Optimized solution
X = int(eval(input()))
n = 0
x = 100
while x < X:
  x += x // 100
  n += 1
print(n)
# Original solution
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def rangeI(it, l, r):
    for i, e in enumerate(it):
        if l <= i < r:
            yield e
        elif l >= r:
            break

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

MOD = 10**9+7

x = int(input())

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

print(count)


# Optimized solution
x = int(eval(input()))
 
a = 100
count = 0
while a < x:
    a = int(a*101//100)
    count += 1
 
print(count)
# Original solution
x = int(eval(input()))
depo = 100
#rate = depo*0.01
count = 0

while depo < x:
    rate = depo*0.01
    depo += rate
    depo = int(depo)
    count += 1
print(count)


# Optimized solution

x = int(eval(input()))
depo = 100
count = 0

while depo < x:
    depo += int(depo*0.01)
    count += 1
print(count)
# Original solution
x = int(eval(input()))
dum = 100
count = 0
while(1):
    if dum >= x:
        break
    dum = dum*1.01
    dum = dum//1
    count += 1
    #print(dum)
print(count)

# Optimized solution
import math
x = int(eval(input()))
a = 100
cnt = 0
while(1):
    cnt += 1
    a += a//100
    if a >= x:
        break
print(cnt)
# Original solution
from math import floor
x = int(eval(input()))
ans = 0
y = 100
while y < x:
    y = floor(y*1.01)
    ans += 1
print(ans)

# Optimized solution
def resolve():
	X = int(eval(input()))
	tmp = 100
	ans = 0
	while tmp<X:
		tmp += tmp//100
		ans += 1
	print(ans)
resolve()
# Original solution
X = int(eval(input()))

save = 100
count = 0
while save < X:
    save += int(save * 0.01)
    count += 1    
print(count)

# Optimized solution
X = int(eval(input()))

m = 100
count = 0
while m < X:
    m *= 1.01
    m = int(m)
    count += 1
print(count)
# Original solution
X = int(eval(input()))
count = 0
money = int(100)

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


# Optimized solution
X = int(eval(input()))
count = 0
money = 100

while True:
  money = int(money * 1.01)
  count += 1
  if money >= X:
    print(count)
    break
# Original solution
X = int(eval(input()))
p = 100
i = 0
while p < X:
    i += 1
    p += int(p*0.01)
print(i)

# Optimized solution
x = int(eval(input()))
i = 0
z = 100
while z < x:
    i += 1
    z = int(z * 1.01)
print(i)
# Original solution
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print(('\n'.join(map(str, x))))

X = int(eval(input()))
v = 100

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


print(cnt)




# Optimized solution
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print(('\n'.join(map(str, x))))

X = int(eval(input()))
v = 100

cnt = 0
while v<X:
    v = v*101//100
    cnt += 1

print(cnt)
# Original solution
import math
x  = int(eval(input()))
y=math.floor(100)
d=int(y)
 
year=0
while y<x:
    y*=1.01
    d=int(y)
    y=d
    year+=1
    #print(y,year)
print(year)

# Optimized solution
x = int(eval(input()))

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

print(year)
# Original solution
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import floor

x = int(readline())
v = 100
for i in range(x):
    v = floor(v * 1.01)
    if v >= x:
        print((i + 1))
        exit()


# Optimized solution
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import floor

x = int(read())
v = 100
for i in range(x):
    v = floor(v * 1.01)
    if v >= x:
        print((i + 1))
        exit()
# Original solution
import math
x = int(eval(input()))

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

# Optimized solution
import math
x = int(eval(input()))

m = 100
cnt = 0
while 1:
    cnt += 1
    m = math.floor(m * 1.01)
    if m >= x:
        break
print(cnt)
# Original solution
x = int(eval(input()))
import sys
sys.setrecursionlimit(4000)

def f(n):
  if n == 1:
    return 101
  else:
    return int(f(n-1)*1.01)
n = 1
while f(n) < x:
  n += 1
else:
  print(n)

# Optimized solution
x = int(eval(input()))
import sys
sys.setrecursionlimit(4000)

import math
p = math.log(1.01, 10)
q = int(math.log(x/100, 10)/p)


def f(n):
  if n == 1:
    return 101
  else:
    return int(f(n-1)*1.01)
n = q
while f(n) < x:
  n += 1
else:
  print(n)
# Original solution
def main():
    x = int(eval(input()))
    m = 100
    for i in range(10**5):
        if m >= x:
            print(i)
            return
        m += m//100

if __name__ == "__main__":
    main()

# Optimized solution
def main():
    x = int(eval(input()))
    money = 100
    for i in range(10**5):
        if money >= x:
            print(i)
            return
        money += money//100


if __name__ == "__main__":
    main()
# Original solution
import math
x = int(eval(input()))
a = 100
ans = 1
while True:
  a = int(math.floor(a*1.01))
  if a >= x:
    print(ans)
    exit()
  else:
    ans += 1

# Optimized solution
import math
x = int(eval(input()))
money = 100
ans = 0
while True:
  if money >= x:
    print(ans)
    exit()
  else:
    money = int(math.floor(money * 1.01))
    ans += 1
# Original solution
x = int(eval(input()))

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

print(ans)

# Optimized solution
x = int(eval(input()))

money, cnt = 100, 0
while money < x:
    money += money // 100
    cnt += 1

print(cnt)
# Original solution
k = int(eval(input()))

now = 100
cnt = 0
while (now < k):
    now *= 1.01
    now = int(now)
    cnt += 1

print(cnt)

# Optimized solution
x = int(eval(input()))
money = 100
ans = 0

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

print(ans)
# Original solution
x = int(eval(input()))
total = 100
year = 0

while x > total:
  year += 1
  total += total//100
print(year)


# Optimized solution
import math
x = int(eval(input()))
initial = 100
count = 0
while initial < x:
  initial += initial//100  
  count += 1
print(count)
# Original solution
a = [100]
for i in range(4000):
    a.append(a[-1] + a[-1] // 100)
x = int(eval(input()))
for i in range(4000):
    if a[i] >= x:
        print(i)
        exit()

# Optimized solution
X = int(eval(input()))
x1 = 100
r = 0.01
t = 0
if 101 <= X <=10**18:
    while x1 < X:
        R = int(x1 * r)
        x1 = R + x1
        t = t + 1
    print(t)
# Original solution
x = int(eval(input()))
money = 100
year = 0

while money < x:
  money += int(money / 100)
  year += 1
  
print(year)


# Optimized solution
x = int(eval(input()))
money = 100
year = 0

while money < x:
  money += money // 100
  year += 1
  
print(year)