def make_divisors(n: int) -> list:
    """自然数nの約数を列挙したリストを出力する
    計算量: O(sqrt(N))
    入出力例: 12 -> [1, 2, 3, 4, 6, 12]
    """
    divisors = []
    for k in range(1, int(n ** 0.5) + 1):
        if n % k == 0:
            divisors.append(k)
            if k != n // k:
                divisors.append(n // k)
    return len(divisors)


x = int(input())
memo = {}


for i in range(x // 2 - 10000, x // 2 + 10000):
    if i > 0:
        memo[i] = i - make_divisors(i)

min_val = 10 ** 9
for i in memo:
    if x - i in memo:
        min_val = min(abs(memo[x - i] - memo[i]), min_val)

ans = []
for i in memo:
    if x - i in memo and abs(memo[x - i] - memo[i]) == min_val:
        ans.append((x - i, i))
ans = sorted(ans)
for res in ans:
    print(*res)