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.
# import sys
# sys.stdout = open('CP/output.txt', 'w')
# sys.stdin = open('CP/input.txt', 'r')

# import os
# import math
# import numpy as np
# from collections import OrderedDict
# from memo import memo #@memo
# from functools import lru_cache #@lru_cache
# from collections import deque #list = deque()
# import random
# from queue import * 

#def gcd(a, b):
#	while b:
#	a, b = b, a % b
#return a
#def lcm(a, b):
#	w = a //gcd(a,b)
#return w * b
#def binary_search(array) -> int:
#    def condition(value) -> bool:
#        pass
#    left, right = min(search_space), max(
#        search_space)  # could be [0, n], [1, n] etc. Depends on problem
#    while left < right:
#        mid = left + (right - left) // 2
#        if condition(mid):
#            right = mid
#        else:
#            left = mid + 1
#    return left


def solver(N):
    if N & 1==0:
        return (f"4 {N-4}")
    else:
        return (f"9 {N-9}") 

if __name__=='__main__':
    N = int(input())
    #pc, pr = map(int, input().split())
    #arr = list(map(int,input().split()))
    print(solver(N))