import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    def score(a):
        b=x-a
        sa=a-cntf[a]
        sb=b-cntf[b]
        return abs(sa-sb)

    x=II()
    cntf=[2]*(x+1)
    cntf[1]=1
    for b in range(2,x):
        if b*2>x:break
        for a in range(2*b,x+1,b):
            cntf[a]+=1
    mn=10**9
    ans=[]
    for a in range(1,x+1):
        s=score(a)
        if s==mn:ans.append((a,x-a))
        if s<mn:
            mn=s
            ans=[(a,x-a)]
    for a in ans:print(*a)

main()