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 static java.lang.Integer.parseInt;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

    public class DesignTutorial {

        static BufferedReader in;
        static PrintWriter out;
        static StringTokenizer tok;

        static void solve() throws Exception {

            int num = nextInt();
            int a=0;
            int b=0;
            int count=0;
            for (int i = 2; i <num ; i++) {
                if(!isPrime(i)){
                    if(!isPrime(num-i)){
                        System.out.println(i+" "+(num-i));
                        break;
                    }
                }
            }
        }

        static boolean isPrime(int n){
            // fast even test.
            if(n > 2 && (n & 1) == 0)
                return false;
            // only odd factors need to be tested up to n^0.5
            for(int i = 3; i * i <= n; i += 2)
                if (n % i == 0)
                    return false;
            return true;
        }
        static int nextInt() throws IOException {
            return parseInt(next());
        }

        static String next() throws IOException {
            while (tok == null || !tok.hasMoreTokens()) {
                tok = new StringTokenizer(in.readLine());
            }
            return tok.nextToken();
        }

        public static void main(String[] args) {
            try {
                in = new BufferedReader(new InputStreamReader(System.in));
                out = new PrintWriter(new OutputStreamWriter(System.out));
                solve();
                in.close();
                out.close();
            }
            catch (Throwable e) {
                e.printStackTrace();
                exit(1);
            }
        }
    }
