#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>
#include<cmath>
#include<set>
#include<random>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
const long long mod = 1000000007;
const long long inf = 1145141919810;
typedef pair<int, int> P;
typedef pair<P, P> PP;
struct edge {int to, cost;};

int ar[31][31],c2[31];

signed main() {
	int k; cin >> k;
	vector<int>V;
	rep(i, 100)V.push_back(3);
	rep(i, k / 100)V.push_back(2);
	k %= 100;
	rep(i, 10)V.push_back(7);
	rep(i, k / 10)V.push_back(6);
	k %= 10;
	rep(i, k)V.push_back(19);
	V.push_back(42);
	cout << V.size() << endl;
	rep(i, V.size()) {
		if (i)cout << ' '; cout << V[i];
	}
	cout << endl;
}