#include using namespace std; using ll = long long; template using vt = vector; template using vvt = vector>; template using ttt = tuple; using tii = tuple; using vi = vector; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define pb push_back #define mt make_tuple #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second #define DEB cerr<<"!"<0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;} inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;} /*Coding Space*/ int main(){ ll k; cin >> k; for(int n = 1; n <=250; n++){ for(int t3 = 0; t3 <= n; t3++) for(int t4 = 0; t3 + t4 <= n; t4++) for(int t5 = 0; t3 + t4 + t5 <= n; t5++){ int t6 = n - (t3 + t4 + t5); if(t3*t4 + t5*t6 == k){ bool flag = 0; cout << n << endl; rep(i,t3) cout << (flag?" ":"") << 3,flag = 1; rep(i,t4) cout << (flag?" ":"") << 4,flag = 1; rep(i,t5) cout << (flag?" ":"") << 5,flag = 1; rep(i,t6) cout << (flag?" ":"") << 6,flag = 1; cout << endl; return 0; } } } }