#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> ans;
void solve() {
  while (n > 0) {
    if (n == 3) {
      ans.push_back(3);
      return;
    } else {
      ans.push_back(2);
      n -= 2;
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  solve();
  cout << ((long long)ans.size()) << endl;
  cout << ans[0];
  for (long long i = 1; i < ((long long)ans.size()); i++) {
    cout << ' ' << ans[i];
  }
  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;
long long n;
vector<long long> ans;
void solve() {
  while (n > 0) {
    if (n == 3) {
      ans.push_back(3);
      return;
    } else {
      ans.push_back(2);
      n -= 2;
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  solve();
  cout << ((long long)ans.size()) << endl;
  cout << ans[0];
  for (long long i = 1; i < ((long long)ans.size()); i++) {
    cout << ' ' << ans[i];
  }
  cout << endl;
  return 0;
}

```