#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int nmax = 1000010;
long long res;
long double eps = 1e-6;
int n, m, p, w;
vector<int> vr;
int main() {
  cin >> n;
  while (n) {
    if (n == 3) {
      vr.push_back(3);
      break;
    }
    n -= 2;
    vr.push_back(2);
  }
  cout << vr.size() << endl;
  for (int i = 0; i < vr.size(); ++i) {
    cout << vr[i] << " ";
  }
  return 0;
}

### Prompt

Generate a CPP solution to the following problem:

Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1.

Recall that integer k is called prime if it is greater than 1 and has exactly two positive integer divisors — 1 and k. 

Input

The only line of the input contains a single integer n (2 ≤ n ≤ 100 000).

Output

The first line of the output contains a single integer k — maximum possible number of primes in representation.

The second line should contain k primes with their sum equal to n. You can print them in any order. If there are several optimal solution, print any of them.

Examples

Input

5


Output

2
2 3


Input

6


Output

3
2 2 2

### Response

```cpp
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int nmax = 1000010;
long long res;
long double eps = 1e-6;
int n, m, p, w;
vector<int> vr;
int main() {
  cin >> n;
  while (n) {
    if (n == 3) {
      vr.push_back(3);
      break;
    }
    n -= 2;
    vr.push_back(2);
  }
  cout << vr.size() << endl;
  for (int i = 0; i < vr.size(); ++i) {
    cout << vr[i] << " ";
  }
  return 0;
}

```