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.
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void ruint(T& a) {
  while ((a = getchar_unlocked() - '0') < 0)
    ;
  for (register char c; (c = getchar_unlocked() - '0') >= 0;)
    a = (a << 3) + (a << 1) + c;
}
struct Reader {
  template <class T>
  Reader& operator,(T& v) {
    cin >> v;
    return *this;
  }
} RD;
struct ReaderU {
  template <class T>
  ReaderU& operator,(T& v) {
    ruint(v);
    return *this;
  }
} RU;
struct Debugger {
  template <class T>
  Debugger& operator,(const T& v) {
    cout << " " << v << flush;
    return *this;
  }
} DB;
struct classcomp {
  template <class T>
  bool operator()(const T& a, const T& b) const {
    return a > b;
  }
};
template <class T>
void Dbrng(T lo, T hi, string note = "", int w = 0) {
  if (0) {
    cout << "Debug[ ";
    if (!note.empty()) cout << setw(3) << note << " : ";
    for (; lo != hi; ++lo) cout << setw(w) << *lo << " ";
    cout << "]" << endl;
  }
}
const int INF = 0x3F3F3F3F;
int N;
int main() {
  ({ RU, N; });
  int cnt = 0, sqrt_limit = sqrt(N);
  std::vector<bool> prime(N + 5, true);
  for (int n = 2; n <= sqrt_limit; ++n) {
    if (!prime[n]) continue;
    for (unsigned k = n * n; k < N; k += n) prime[k] = 0;
  }
  for (int i = (1), _i = (N); i <= _i; ++i) {
    if (!prime[i] && !prime[N - i]) {
      printf("%d %d\n", i, N - i);
      return 0;
    }
  }
  return 0;
}
