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.IOException;
import java.io.InputStreamReader;

public class Words {

public static void main(String[] args) throws IOException {

BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 
String st = br.readLine();
int n = Integer.parseInt(st);
int max = (int) Math.pow(10, 6);
int[] cri = new int[ max ];

for( int c = 0 ; c < max ; c++){
cri[c] = 1;
}

for( int i = 2; i< (int) Math.sqrt(max); i++){
if( cri[i-1] == 1){
for( int j = i; j*i<max ; j++){
cri[i*j - 1] = 0;
}
}
}

int[] res = new int[2];

int f = n/2;
int r = n%2;

res[0] = f;
res[1] = f + r;

if(cri[ res[0] -1 ] == 1 || cri[ res[1] -1 ] == 1){
res[0] = res[0] + 2;
res[1] = res[1] - 2;
}


if(cri[ res[0] -1 ] == 1 || cri[ res[1] -1 ] == 1){
res[0] = res[0] - 4;
res[1] = res[1] + 4;
}

if(cri[ res[0] -1 ] == 1 || cri[ res[1] -1 ] == 1){
res[0] = res[0] + 3;
res[1] = res[1] - 3;
}

System.out.println(res[0] + " " + res[1]);

}
}