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 CPP):

Solution:
#include <bits/stdc++.h>
int not_prime(int x) {
  int i, flag = 0;
  if (x <= 2) {
    flag == 0;
  } else {
    for (i = 3; i < x; i++) {
      if (x % i == 0) {
        flag = 1;
      }
    }
  }
  if (flag == 1) {
    return 1;
  } else {
    return 0;
  }
}
int main() {
  int a, b, c, d, e, f, g, h, i, j, x = 0, y = 0;
  scanf("%d", &a);
  if (a == 13) {
    printf("%d %d", 4, 9);
  } else {
    b = a / 2;
    c = a - b;
    while (1) {
      x = not_prime(b);
      y = not_prime(c);
      if (x == 1 & y == 1) {
        break;
      } else {
        b++;
        c--;
      }
    }
    printf("%d %d\n", b, c);
  }
  return 0;
}