#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, c2 = 0, c3 = 0;
  cin >> n;
  while (n) {
    if (n == 3) {
      n = n - 3;
      c3++;
    } else {
      n = n - 2;
      c2++;
    }
  }
  cout << c2 + c3 << endl;
  for (int i = 1; i <= c2; i++)
    cout << "2"
         << " ";
  for (int i = 1; i <= c3; i++)
    cout << "3"
         << " ";
  cout << endl;
  return 0;
}

### Prompt

Your challenge is to write 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>
using namespace std;
int main() {
  int n, c2 = 0, c3 = 0;
  cin >> n;
  while (n) {
    if (n == 3) {
      n = n - 3;
      c3++;
    } else {
      n = n - 2;
      c2++;
    }
  }
  cout << c2 + c3 << endl;
  for (int i = 1; i <= c2; i++)
    cout << "2"
         << " ";
  for (int i = 1; i <= c3; i++)
    cout << "3"
         << " ";
  cout << endl;
  return 0;
}

```