import sys
sys.setrecursionlimit(1000000)  # 设置递归深度，防止栈溢出

N = 210
w = [0] * N  # 存储每一堆石子的数量
cnt = 0      # 当前石子堆的个数
m = 0        # 记录最大石子堆数
d = float('inf')  # 记录最小极差

def getd():
    """计算当前石子堆的最大值与最小值之差"""
    max_val = max(w[:cnt])
    min_val = min(w[:cnt])
    return max_val - min_val

def dfs():
    global m, d, cnt
    current_diff = getd()
    # 更新答案
    if cnt > m:
        m = cnt
        d = current_diff
    elif cnt == m:
        if current_diff < d:
            d = current_diff

    if cnt == 1:  # 只有一堆的情况
        a = w[0]
        for x in range(a // 3 + 1, a // 2 + 1):
            w[0] = x
            w[cnt] = a - x
            cnt += 1
            dfs()
            # 恢复现场
            w[0] = a
            cnt -= 1
    else:
        # 找到第一和第二大的堆
        i, j = 0, -1
        for k in range(1, cnt):
            if w[k] >= w[i]:
                j = i
                i = k
            elif j == -1 or w[k] > w[j]:
                j = k

        a, b = w[i], w[j] if j != -1 else 0
        if a > b:
            for x in range(max(b // 2, a // 3) + 1, a // 2 + 1):
                w[i] = x
                w[cnt] = a - x
                cnt += 1
                dfs()
                # 恢复现场
                w[i] = a
                cnt -= 1
        else:
            return

n = int(input())
w[cnt] = n
cnt += 1
dfs()
print(m, d)