Problem: 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.

Solution (in JAVA):

Solution:
import java.util.Scanner;
public class Math {
	static int[] primes;
	public static void main(String args[]) throws Exception
	{
		int n;
		Scanner s = new Scanner(System.in);
		n = s.nextInt();
		int a = 4;
		int b = n-a;
		primes = new int[1005];
		genPrimes();
		//print();
		while(a<=b)
		{
			if((a%2==0)&&(b%2==0))
			{
				System.out.println(a+" "+b);
				return;
			}
			else 
			{
				if(checkForPrime(a,b))
				{
					System.out.println(a+" "+b);
					return;
				}
			}
			a++;
			b--;
		}
	}

	private static void genPrimes() {
		primes[0]=1;
		primes[1]=1;
		for(int i=2;i<=1000;i++)
		{
			if(primes[i]==0)
			{
				for(int j=i+i;j<=1000;j=j+i)
				{
					primes[j]=1;
				}
			}
		}
		
	}

	private static boolean checkForPrime(int a, int b) {
		boolean ba,bb;
		if(a%2==0)
			ba=true;
		else
		{
			ba=check(a);
		}
		if(b%2==0)
			bb=true;
		else
		{
			bb=check(b);
		}
		return ba&&bb;
	}

	private static void print()
	{
		for(int i=0;i<=1000;i++)
		{
			System.out.println(i+ " " +primes[i]);
		}
	}
	private static boolean check(int a) {
		for(int i=0;i<=1000;i++)
		{
			if(primes[i]==0)
			{
				if(a==i)
				{
					return false;
				}
				if(a%i==0)
					return true;
			}
		}
		return false;
	}
}