from typing import Dict
from collections import defaultdict


class SmallestPrimeFactors:
    def __init__(self, n: int) -> None:
        self.spf = list(range(n + 1))
        self.spf[0] = -1
        self.spf[1] = -1
        for i in range(2, int(n ** 0.5) + 1):
            if self.spf[i] == i:
                for j in range(i * i, n + 1, i):
                    if self.spf[j] == j:
                        self.spf[j] = i

    def is_prime(self, x: int) -> bool:
        assert x < len(self.spf)
        return self.spf[x] == x

    def factor(self, x: int) -> Dict[int, int]:
        assert x < len(self.spf)
        if x < 2:
            return {}
        res = defaultdict(int)
        while True:
            if x < 2 or self.is_prime(x):
                if x != 1:
                    res[x] += 1
                break
            s = self.spf[x]
            while x % s == 0:
                x //= s
                res[s] += 1
        return res


def f(x):
    res = 1
    for v in spf.factor(x).values():
        res *= v + 1
    return x - res


x = int(input())
spf = SmallestPrimeFactors(x)
ans = []
cur_min = 1 << 62
for i in range(1, x // 2 + 1):
    a, b = i, x - i
    tmp = abs(f(a) - f(b))
    if tmp < cur_min:
        ans = [(a, b), (b, a)] if a != b else [(a, b)]
        cur_min = tmp
    elif tmp == cur_min:
        ans += [(a, b), (b, a)] if a != b else [(a, b)]
for a, b in sorted(ans):
    print(a, b)