#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint N;
  cin >> N;
  if(N == 0) {
    cout << -1 << endl;
  } else if(N <= 100) {
    cout << N << endl;
    REP(i, N) cout << 1 << (i!=N-1 ? " " : "");
    cout << "\n";
  } else {
    vector<lint> ans;
    vector<bool> prime(1000001, true);
    prime[1] = false;
    FOR(i, 2, 1000001) if(prime[i]) for(int j=i*2; j<1000001; j+=i) prime[j] = false;
    vector<lint> p;
    FOR(i, 2, 1000001) if(prime[i]) p.push_back(i);
    lint x = N-1;
    while(true) {
      bool ok = true;
      for(lint y : p) {
        if(y > x) break;
        if(x%y == 0) ok = false;
      }
      if(ok) break;
      x--;
    }
    ans.push_back(x);
    N -= x + 1;
    REP(i, N) ans.push_back(1);
    cout << ans.size() << endl;
    REP(i, ans.size()) cout << ans[i] << (i!=ans.size()-1 ? " " : "");
    cout << "\n";
  }
}