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 java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class A_349 {

    static StringTokenizer st;
    static BufferedReader br;
    static PrintWriter pw;
    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        int n = nextInt();
        int x1 = n/2;
        int x2 = n/2;
        if(x1+x2!=n){
        	x2++;
        }
        while(true){
        	boolean ok1 = isPrime(x1);
        	boolean ok2 = isPrime(x2);
        	if(!ok1 && !ok2){
        		break;
        	}
        	if(ok1){
        		if(x2>3){
        			x2--;
        			x1++;
        		}else{
        			if(x1>3)
	        			x2++;
	        			x1--;
        		}
        	}else{
        		if(x2>3){
        			x2--;
        			x1++;
        		}else{
        			if(x1>3)
        				x2++;
        			x1--;
        		}
        	}
        }
        pw.println(x1+" "+x2);
        pw.close();
    }

    private static boolean isPrime(int x2) {
    	for (int i = 2; i <= Math.sqrt(x2); i++) {
			if(x2%i==0) return false;
		}
    	return true;
	}

	private static boolean isDistinct(String string) {
    	char[]x = string.toCharArray();
    	for (int i = 0; i < x.length-1; i++) {
			for (int j = i+1; j < x.length; j++) {
				if(x[i]==x[j]) return false;
			}
		}
    	return true;
	}

	private static boolean isLucky(String s) {
    	int cnt = 0;
    	for (int i = 0; i < s.length(); i++) {
    		if(s.charAt(i)=='4' || s.charAt(i)=='7'){
    			cnt++;
    		}
		}
    	if(cnt==4 || cnt==7)	
    		return true;
    	else
    		return false;
    }

	private static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    private static long nextLong() throws IOException {
        return Long.parseLong(next());
    }
    private static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
    private static String next() throws IOException {
        while (st==null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }
}
class Pr implements Comparable<Pr>{
	int index;
	int value;
	Pr(int index, int value){
		this.index=index;
		this.value=value;
	}
	@Override
	public int compareTo(Pr arg0) {
		return this.value-arg0.value;
	}
}