One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.

For example, there is a statement called the "Goldbach's conjecture". It says: "each even number no less than four can be expressed as the sum of two primes". Let's modify it. How about a statement like that: "each integer no less than 12 can be expressed as the sum of two composite numbers." Not like the Goldbach's conjecture, I can prove this theorem.

You are given an integer n no less than 12, express it as a sum of two composite numbers.

Input

The only line contains an integer n (12 ≤ n ≤ 106).

Output

Output two composite integers x and y (1 < x, y < n) such that x + y = n. If there are multiple solutions, you can output any of them.

Examples

Input

12


Output

4 8


Input

15


Output

6 9


Input

23


Output

8 15


Input

1000000


Output

500000 500000

Note

In the first example, 12 = 4 + 8 and both 4, 8 are composite numbers. You can output "6 6" or "8 4" as well.

In the second example, 15 = 6 + 9. Note that you can't output "1 14" because 1 is not a composite number.
# for _ in range(int(input())):
#     n,k=map(int,input().split())
#     arr = [int(x) for x in input().split()]
# c=[0]*n
# #d=[]
# i=0
# x=0
# while(max(arr)!=-1):
#     x=k-arr[i]
#     if(arr!=-1):
#         c[arr.index(arr[i])]=1
#         arr[arr.index(arr[i])]= -1
#         if(x in arr):
#             while(x in arr):
#                 arr[arr.index(x)]= -1
#                 if(x in arr):
#                     c[arr.index(x)]=1
#                     arr[arr.index(x)]= -1
#     i+=1
# print(" ".join(str(gh) for gh in c))
# ans = 0
# c=1
# for i in range(n):
#     if(2*arr[i] == k):
#         c=c+1
#         ans=(c)%2
#     else:
#         if(2*a[i]<k):
#             ans = 0
#         else:
#             ans=1
#     print(str(ans),end=" ")
# print("\n")
########################
#                        #
#     COLOUR REVOLUTIONN    #
#                        #
#####################

# for _ in range(int(input())):
#     n,k=map(int,input().split())
#     if(k != 1):
#         a = abs((1-(k**4))//(1-k))
#         n1 = n//a
#     else:
#         n1 = 1
#     for i in range(4):
#         print(str(n1*(k**i)),end=' ')
#     print('\n')

########################################

#            CABEL CAR                 #

########################################

# r,g,b = map(int,input().split())
# co = -1
# while(r >0 or g>0 or b>0):
#     co += 1
#     r -= 2
#     if(r <=0 and g<=0 and b<=0):
#         break
#     co += 1
#     g -= 2
#     if(r <=0 and g<=0 and b<=0):
#         break
#     co+=1
#     b-=2
# print(co+30)

########################################

#            ROAD TO ZERO              #

########################################

# for _ in range(int(input())):
#     x,y = map(int, input().split())
#     a,b = map(int, input().split())
#     a1 = min(x,y)
#     b1=max(x,y)
#     op1=0
#     op2=0
#     if(a*2 <= b):
#         print((x+y)*a)
#     else:
#         op1=a1*b
#         op2=(b1-a1)*a
#         print(op1+op2)

########################################

#          FANCY FENCE                 #

########################################

# from math import ceil,floor
# for _ in range(int(input())):
#     a = float(input())
#     if(a==180):
#         print("YES")
#     else:
#         n = 360/(180-a)
#         if(ceil(n) == floor(n)):
#             print("YES")
#         else:
#             print("NO")

########################################

#       NEW YEAR TRANSORTATION         #

########################################

# m,n = map(int,input().split())
# a = [int(x) for x in input().split()]
# c=0
# for i in range(1,m-1):
#     c+=a[i-1]
#     if(c==n):
#         print("YES")
#         break
#     if(c>n):
#         print("NO")
#         break
# if(c<n):
#     print("NO")
###################
# flag = 0
# while(c<n):

#     if(c==n-1):
#         print("YES")
#         flag=1
#         break
#     c+=a[c]
# if(flag == 0):
#     print("NO")

########################################

#      CANDIES AND TWO SISTERS         #

########################################

# for _ in range(int(input())):
#     a = int(input())
#     if(a%2==0):
#         print((a//2)-1)
#     else:
#         print(a//2)

########################################

#          LEARN FROM MATHS            #

########################################

a = int(input())
if(a % 2 == 0):
    print(str(8)+" "+str(a-8))
else:
    print(str(9)+" "+str(a-9))
