#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int K;
int MAX=250;

void solve() {
    cin>>K;
    REP1(a,MAX)REP1(b,MAX)REP1(c,MAX) {
        if (a+b>MAX) continue;
        int p = K-a*b;
        if (p<0) continue;
        if (p==0) {
            out("%lld\n",a+b);
            REP(i,a)out("3 ");
            REP(i,b)out("4 ");
            out("\n");
            return;
        }
        if (p%c) continue;
        int d = (K-a*b)/c;
        if (a+b+c+d>MAX) continue;
        out("%lld\n",a+b+c+d);
        REP(i,a)out("3 ");
        REP(i,b)out("4 ");
        REP(i,c)out("5 ");
        REP(i,d)out("6 ");
        out("\n");
        return;
    }
}