Problem: Dima loves representing an odd number as the sum of multiple primes, and Lisa loves it when there are at most three primes. Help them to represent the given number as the sum of at most than three primes.

More formally, you are given an odd numer n. Find a set of numbers pi (1 ≤ i ≤ k), such that

  1. 1 ≤ k ≤ 3
  2. pi is a prime
  3. <image>



The numbers pi do not necessarily have to be distinct. It is guaranteed that at least one possible solution exists.

Input

The single line contains an odd number n (3 ≤ n < 109).

Output

In the first line print k (1 ≤ k ≤ 3), showing how many numbers are in the representation you found.

In the second line print numbers pi in any order. If there are multiple possible solutions, you can print any of them.

Examples

Input

27


Output

3
5 11 11

Note

A prime is an integer strictly larger than one that is divisible only by one and by itself.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void sfsf() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
const int mxn = 2e5 + 5, N = 8e1 + 5, mod = 1e9 + 7, inf = 0x3f,
          mod2 = 999119999, mod3 = 1000992299, pow1 = 31, pow2 = 53;
bitset<mxn> vis;
bool prime(long long num) {
  if (num <= 1 || (num % 2 == 0 && num != 2)) return false;
  for (long long i = 2; i * i <= num; i++)
    if (num % i == 0) return false;
  return true;
}
int main() {
  sfsf();
  long long n;
  cin >> n;
  long long tmp = n;
  if (prime(n)) return cout << 1 << endl << n, 0;
  while (!prime(tmp)) tmp--;
  if (prime(n - tmp))
    cout << 2 << endl << tmp << " " << n - tmp;
  else {
    for (int i = 2; i < n - tmp; i++) {
      if (prime(i) && prime(n - tmp - i))
        return cout << 3 << endl << tmp << " " << i << " " << n - tmp - i, 0;
    }
  }
  return 0;
}