#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned long long
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<long long>
#define vvel vector<vector<long long>>
#define vvepll vector<vepll>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define bl __int128_t
#define cleout(i) cout<<fixed<<setprecision(i)
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> dx={ -1, 0, 1, 0 };
vector<int> dy={ 0, 1, 0, -1 };


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll N, K, M, L, R, T, Q, H, W, i, j, l, r;
ll x, y, z;
unsigned long long q;
string S;
long double k;
ll inf=1000000000000000000;//1e18
// inf=1e9+7;
// LLONG_MAX

//mt19937_64 rng((ull) chrono::steady_clock::now().time_since_epoch().count());

//[x^M]1/(1-x)^N=comb(N-1+M,M)



void _solve(){
    N=120;
    vel v;
    for(ll i=1;i*i<=N;i++){
        if(N%i==0){
            v.push_back(i);
            v.push_back(N/i);
        }
    }
    ll n=v.size();
    rep(i,0,(1ll<<n)){
        if(popcount((ull)i)<10)continue;
        ll l=1;
        ll sum=0;
        rep(j,0,n){
            if(i&(1ll<<j)){
                sum+=v[j];
                l=lcm(l,v[j]);
            }
        }
        rep(j,0,n){
            if(i&(1ll<<j)){
                if(sum-v[j]==l){
                    cout<<popcount((ull)i)<<"\n";
                    rep(k,0,n){
                        if((1ll<<k)&i)cout<<v[k]<<" ";
                    }
                    return ;
                }
            }
        }
    }
}


int main(){
    cin.tie(nullptr);
 	ios_base::sync_with_stdio(false);

    
    ll _;
    bool multitest=0;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}