#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

void findPrime(int N, vector<bool>& isPrime)
{
    isPrime.assign(N+1, true);
    isPrime[0] = isPrime[1] = false;
    for(int i=2; i*i<=N; i++){
        if(isPrime[i]){
            for(int j=i; i*j<=N; j++){
                isPrime[i*j] = false;
            }
        }
    }
}

const int MAX = 1000000;
const int SIZE = 250;

void solve(int k, vector<int>& ans)
{
    vector<bool> isPrime;
    findPrime(2*MAX, isPrime);

    for(int a=1; ; ++a){
        for(int b=0; ; ++b){
            int n = a * (a - 1) / 2 + a * b;
            if(k < n)
                break;

            if((k - n) % 2 != 0)
                continue;
            int c = (k - n) / 2;
            if(a + b + c + 1 <= SIZE){
                const int x[] = {1, 2, 7, 24};
                const int y[] = {a, b, c, 1};
                ans.clear();
                for(int i=0; i<4; ++i){
                    for(int j=0; j<y[i]; ++j){
                        ans.push_back(x[i]);
                    }
                }
                return;
            }
        }
    }
}

int main()
{
    int k;
    cin >> k;

    vector<int> v;
    solve(k, v);

    int n = v.size();
    cout << n << endl;
    cout << v[0];
    for(int i=1; i<n; ++i)
        cout << ' ' << v[i];
    cout << endl;

    return 0;
}