#include <vector>
#include <iostream>
using namespace std;
// Proved: (the size of sequence) <= 159
int main() {
	int N;
	cin >> N;
	int a = 1;
	while (a * (a - 1) / 2 < N) a++;
	int b = 1;
	while (b * (b - 1) / 2 < a * (a - 1) / 2 - N) b++;
	int rem = N - a * (a - 1) / 2 + b * (b - 1) / 2;
	vector<int> ret;
	for (int i = 0; i < a - b; i++) ret.push_back(1);
	for (int i = 0; i < b; i++) ret.push_back(2);
	ret.push_back(7);
	for (int i = 0; i < rem; i++) ret.push_back(24);
	cout << ret.size() << '\n';
	for (int i = 0; i < ret.size(); i++) {
		if (i) cout << ' ';
		cout << ret[i];
	}
	cout << '\n';
	return 0;
}