#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max<R>(x,0.0));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

// Problem Specific Parameter:

// Description: グラフの型定義(これは最小費用流)
// Verifyed: Many Diffrent Problem 

//Appropriately Changed
using edge=struct{int to;};
using G=vector<vector<edge>>;

//Appropriately Changed
void add_edge(G &graph,int from,int to){ 
	graph[from].push_back({to});
	graph[to].push_back({from});
}

auto maximum_independent_sets(const G& graph){
    const int n=graph.size();
	using T=bitset<121>;
	vector<T> edge(n,T("0"));
	rep(i,n) for(auto &e:graph[i]) edge[i].set(e.to);

	auto dfs=[&](int v,T used){
		auto func=[&](int v,T used,auto func)->T{
			if(v==n) return T("0");
			if(used[v]) return func(v+1,used,func);

			used.set(v);
			T ret=func(v+1,used|edge[v],func);
			ret.set(v);

			if(((~used)&edge[v]).count()>=2){
				T arg=func(v+1,used,func); // not used v
				if(ret.count()<=arg.count()) ret=arg;
			}
			return ret;
		};
		return func(v,used,func);
	};

	return dfs(0,T("0"));
}

const ll mod=1000003LL;


int main(void){
	ll s;
	cin >> s;

	s=(s*12345LL)%mod;
    ll n=(s%120)+2;
 	s=(s*12345LL)%mod;
    ll p=s;

    G graph(n);

    rep(i,n){
    	rep(j,i+1,n){
    		s=(s*12345LL)%mod;
    		if(s>=p) add_edge(graph,i,j);
    	}
    }
 	
    auto ans=maximum_independent_sets(graph);
    vector<int> out;
    rep(i,n) if(ans[i]) out.push_back(i+1);

    if(int(out.size())==n){
    	puts("-1");
    }else{
    	cout << int(out.size())+1 << endl;
    	rep(i,out.size()) cout << (i?" ":"") << out[i]+1;
    	cout << endl;
    }

    /*
    rep(v,n){
    	for(auto &e:graph[v]) cout << e.to << " ";
    	cout << endl;
    }
    */
	return 0;
}