N = int(input())
K = []
for k in range(1,N+1):
    if k*(k+1)//2>N:break
    K.append(k*(k+1)//2)
A = set(K)
for k1 in K:
    for k2 in K:
        A.add(k1+k2)
A = sorted(list(A))
from bisect import bisect_left
ind = bisect_left(K,N)
if ind<len(K) and K[ind]==N:
    print(1)
elif N in A:
    print(2)
else:
    print(3)