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>
using namespace std;
const double pi = acos(-1.0);
const double pii = 2 * pi;
const double eps = 1e-6;
const long long MOD = 1e9 + 7;
pair<int, int> twoSum(vector<int> v, int sum) {
  int low = 0, high = v.size() - 1;
  pair<int, int> p;
  while (low < high) {
    if (v[low] + v[high] == sum) {
      p = make_pair(v[low], v[high]);
      return p;
    } else if (v[low] + v[high] > sum)
      high--;
    else
      low++;
  }
  return p;
}
bool isComposite(int n) {
  if (n <= 1) return false;
  if (n <= 3) return false;
  if (n % 2 == 0 || n % 3 == 0) return true;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return true;
  return false;
}
void solve() {
  int n;
  cin >> n;
  vector<int> v;
  for (int i = 2; i < n; i++) {
    if (isComposite(i)) v.push_back(i);
  }
  pair<int, int> p = twoSum(v, n);
  cout << p.first << " " << p.second;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
}