def solve(n):
    T = []
    i = 1
    exists = set()
    while 1:
        t = i * (i + 1) // 2
        if t < n:
            T.append(t)
            exists.add(t)
        elif t == n:
            return 1
        else:
            break
        i += 1

    for t in T:
        if n - t in exists:
            return 2

    return 3

if __name__ == '__main__':
    n = int(input())
    print(solve(n))