import sys
import math

def check(x):
    if x <= 1:
        return False
    for i in range(2, int(math.sqrt(x)) + 1):
        if x % i == 0:
            return False
    return True

n = int(sys.stdin.read().strip())

check1 = False
for i in range(2, n + 1):
    if check(i) and check(n - i):
        print(i, n - i)
        check1 = True
        break

if not check1:
    print(0)

def sieve(n):
    prime = [True] * (n + 1)
    p = 2
    while p * p <= n:
        if prime[p] == True:
            for i in range(p * p, n + 1, p):
                prime[i] = False
        p += 1
    return prime

def main():
    N = 10**6 + 10
    primes = sieve(N)
    
    n = int(input())
    
    for i in range(2, n + 1):
        if primes[i] and primes[n - i]:
            print(f"{i} {n - i}")
            return

    print(-1)

if __name__ == "__main__":
    main()