import math

def soinsu(lists, num):
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            lists.append(i)
            return soinsu(lists, num / i)
    
    lists.append(int(num))
    lists.append(1)
    return lists

def tindon(lists, num=1, sets=set(), longer=0):
    for i in range(2):
        num *= (lists[longer] ** i)
        if longer != len(lists) - 1:
            tindon(lists, num, sets, longer + 1)
        else:
            sets.add(num)

    return len(sets)
        
x = int(input())
ans, big = [], x

for i in range(1, x // 2 + 1):    
    a = i - tindon(soinsu([], i), sets=set())
    b = x - i - tindon(soinsu([], x-i), sets=set())

    if abs(a - b) == big:
        big = abs(a - b)
        ans.append(i)
        ans.append(x - i)
    elif abs(a - b) < big:
        ans.clear()
        ans.append(i)
        ans.append(x - i)
        big = abs(a - b)

ans.sort()

for i in ans:
    print(i, x - i)