#include <bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
using ll=long long;
void solve() {
    int b;
    cin>>b;
    __int128_t n=500000;
    cout<<(ll)n<<'\n';
    const __int128_t M=8e22;
    vector<__int128_t> ans(n+1);
    ans[n]=M/(1ll*n*(n+1));
    __int128_t sum=0;
    for(int i=n-2;i>=n-2*(b-1);i-=2){
        ans[i]=ans[i+2]*(i+2)*(i+3)/(1ll*i*(i+1));
        ans[i+1]=i*ans[i]-(i+3)*ans[i+2];
    }
    // cerr<<(-M/(n*(n+1))*(n+1)+M/((n-2)*(n-1))*(n-2))<<' '<<M/((n-2)*(n-1))<<" "<<M/((n-1)*n)<<' '<<M/(n*(n+1))<<'\n';
    for(int i=n-2*(b-1)-1;i>=1;i--) ans[i]=ans[i+1]+1;
    for(int i=n;i>=1;i--)   {cout<<(ll)ans[i]<<' ';if(i!=n)  assert(ans[i]>ans[i+1]);}
    cout<<'\n';
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0);
    int _ = 1;
    //cin >> _;
    while(_--) solve();
    return 0;
}