def isPrime(m):
for i in range(2,m):
if m%i==0:
return False
return True
while True:
try:
s1=[]
s2=[]
s3=[]
num= int(input())
for i in range(num//2):
a=num//2-i
b=num//2+i
if isPrime(a) and isPrime(b):
s1.append(a)
s2.append(b)
s3.append(b-a)
m=min(s3)#得到差值最小
inde=s3.index(m)
print(s1[inde])
print(s2[inde])
except:
break