Лесенки

r = ((int(input()) * 2) ** 0.5) - 0.4
print(int(r))

n = map(int,'1 1 2 2 3 4 5 6 8 10 12 15 18 22 27 32 38 46 54 64 76 89 104 122 142 165 192 222 256 296 340 390 448 512 585 668 760 864 982 1113 1260 1426 1610 1816 2048 2304 2590 2910 3264 3658'.split())
for i in n:
    print(i, int((i * 2) ** 0.5 - 0.4))

r = ((int(input()) * 2) ** 0.5) - 0.4
print(int(r)+1)

r = int(input())
print(r-1 if r>1 else 1)

def kol_les(k,n):
    ans=0
    if n==0:
        return ans+1
    elif k<n:
        for i in range(k+1,n+1):
            ans+=kol_les(i, n-i)
        return ans
    else:
        return ans
n=int(input())
print(kol_les(0,n))

print((lambda f, n: f(f, n, [0] * (n + 1)))(lambda self, n, memo, c=1: memo.__setitem__(n, 1) or memo[n] if n == 0 else memo[n] if memo[n] else sum(map(lambda i: self(self, n - i, memo, i + 1), range(c, n + 1))), int(input())))

from functools import lru_cache
 
 
@lru_cache(maxsize=None)
def ladder(n, current_floor=1):
    if n == 0:
        return 1
 
    count = 0
    for i in range(current_floor, n + 1):
        count += ladder(n - i, i + 1)
 
    return count
 
 
result = ladder(int(input()))
print(result)