#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,1,0,-1,1,1,-1,-1,0}; const ll dx[9]={1,0,-1,0,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } using bs=bitset<128>; vector maxindependent(vector mat,int trial=1000000){ int n=mat.size(); int ans=0; bs cand; vector order(n);rep(i,n)order[i]=i; mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); while(trial--){ shuffle(all(order),mt); bs used; int ret=0; for(auto i:order){ if((used&mat[i]).any())continue; used[i]=1;ret++; } if(ans lc; for(int i=0;i> s; ll mod=1000003; s=s*12345%mod; ll n=s%120+2; s=s*12345%mod; ll p=s; vector mat(n); rep(i,n){ repl(j,i+1,n){ s=(s*12345)%mod; if(s>=p){ mat[i][j]=1; mat[j][i]=1; } } } auto f=maxindependent(mat); cout << f.size()+1 << endl; rep(i,f.size()){ if(i)cout << " "; cout << f[i]+1; } cout << endl; }