from typing import List
from collections import Counter
from functools import reduce


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 __traverse(self, x: int) -> List[int]:
        if self.spf[x] == x:
            return [x]
        nxt = x // self.spf[x]
        return self.__traverse(nxt) + [self.spf[x]]

    def factor(self, x: int) -> List[int]:
        assert x < len(self.spf)
        if x < 2:
            return []
        return self.__traverse(x)


def calc_score(x):
    cntr = Counter(spf.factor(x))
    if len(cntr) == 0:
        return x - 1
    return x - reduce(lambda x, y: x * y, [v + 1 for v in cntr.values()])


x = int(input())
spf = SmallestPrimeFactors(x)
ans = []
cur_min = 1 << 62
for i in range(1, x + 1):
    tmp = abs(calc_score(i) - calc_score(x - i))
    if tmp < cur_min:
        ans = [(i, x - i)]
        cur_min = tmp
    elif tmp == cur_min:
        ans.append((i, x - i))
for a, b in ans:
    print(a, b)