#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 20;

//最大独立集合のサイズは補グラフのクリーク数を考える
//最小頂点被覆は(頂点数)-(最大独立集合のサイズ)
//solに最大クリークを形成する頂点集合を格納
class CliqueNumber{
private:
	static const int MAX_V = 210;
	int V, ans;
	int el[MAX_V][MAX_V / 30 + 1];
	int dp[MAX_V];
	int s[MAX_V][MAX_V / 30 + 1];
    bool dfs(int v, int k) {
		int c = 0, d = 0;
		for(int i = 0; i < (V + 31) / 32; i++){
			s[k][i] = el[v][i];
			if (k != 1) s[k][i] &= s[k - 1][i];
			c += __builtin_popcount(s[k][i]);
		}
		if(c == 0){
			if(k > ans){
				ans = k;
				sol.clear();
				sol.push_back(v);
				return 1;
			}
			return 0;
		}
		for(int i = 0; i<(V + 31) / 32; i++){
			for(int a = s[k][i]; a; d++){
				if (k + (c - d) <= ans) return 0;
				int lb = a&(-a), lg = 0;
				a ^= lb;
				while (lb != 1) {
					lb = (unsigned int)(lb) >> 1;
					lg++;
				}
				int u = i * 32 + lg;
				if (k + dp[u] <= ans) return 0;
				if (dfs(u, k + 1)) {
					sol.push_back(v);
					return 1;
				}
			}
		}
		return 0;
	}
public:
	vector<int> sol;
	CliqueNumber(int node_size) {
		V = node_size; ans = 0;
		memset(el, 0, sizeof(int) * MAX_V * (MAX_V / 30 + 1));
		memset(dp, 0, sizeof(int) * MAX_V);
	}
    void add_edge(int u, int v) {
        if (u > v) swap(u, v);
        if (u == v) return;
        el[u][v / 32] |= (1 << (v % 32));
    }
	int solve() {
		for(int i = V - 1; i >= 0; i--){
			dfs(i, 1);
			dp[i] = ans;
		}
		return ans;
	}
};

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int p,s,n;
	cin >> s;
	s = (ll)s * 12345 % 1000003;
    n = s % 120 + 2;
    s = (ll)s * 12345 % 1000003;
    p = s;
	CliqueNumber cn(n);
    rep(i,n){
		srep(j,i+1,n){
			s = (ll)s * 12345 % 1000003;
			if(s < p){
				cn.add_edge(i,j);
			}
        }
	}
	cout << cn.solve() + 1 << "\n";
	rep(i,len(cn.sol)-1){
		cout << cn.sol[i] + 1 << " ";
	}
	cout << cn.sol.back() + 1 << "\n";
    return 0;
}