#include<bits/stdc++.h>
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return true;}return false;}
template<class T,class U> inline bool chmax(T&x,U y){if(x<y){x=y;return true;}return false;}

void rec_MIS(int n, std::vector<std::vector<int>>&e, std::vector<bool>&vis, std::vector<int>&d, std::vector<int>&tmp, std::vector<int>&ans){
    int D{}, idx{-1};
    for(int i{};i<n;++i){
        if(vis[i]) continue;
        if(d[i] == 0){
            vis[i]=true;
            tmp.push_back(i);
            rec_MIS(n, e, vis, d, tmp, ans);
            tmp.pop_back();
            vis[i]=false;
            return;
        }
        if(d[i] == 1){
            vis[i]=true;
            for(auto&j:e[i]) if(!vis[j]){
                vis[j]=true;
                for(auto&k:e[j]) --d[k];
                tmp.push_back(i);
                rec_MIS(n, e, vis, d, tmp, ans);
                tmp.pop_back();
                for(auto&k:e[j]) ++d[k];
                vis[j]=false;
                break;
            }
            vis[i]=false;
            return;
        }
        if(D < d[i]){
            D = d[i];
            idx = i;
        }
    }
    if(idx==-1){
        if(ans.size() < tmp.size()) ans = tmp;
        return;
    }
    vis[idx] = true;
    std::vector<int> idxs;
    idxs.reserve(D);
    for(auto&j:e[idx]) if(!vis[j]){
        idxs.push_back(j);
        vis[j]=true;
        for(auto&k:e[j]) --d[k];
    }
    tmp.push_back(idx);
    rec_MIS(n, e, vis, d, tmp, ans);
    tmp.pop_back();
    for(auto&j:idxs){
        vis[j]=false;
        for(auto&k:e[j]) ++d[k];
        if(D>2) --d[j];
    }
    if(D>2){
        rec_MIS(n, e, vis, d, tmp, ans);
        for(auto&j:idxs) ++d[j];
    }
    vis[idx] = false;
}

std::vector<int> MIS(std::vector<std::vector<int>>&e){
    int n = e.size();
    std::vector<bool> vis(n);
    std::vector<int> d;
    d.reserve(n);
    for(auto&v:e) d.push_back(v.size());
    std::vector<int> tmp,ans;
    rec_MIS(n, e, vis, d, tmp, ans);
    return ans;
}

int main(){
    int64_t s;
    constexpr int64_t base = 12345, mod = 1000003;
    std::cin>>s;
    (s*=base) %= mod;
    int n = s%120 + 2;
    (s*=base) %= mod;
    int p = s;
    std::vector<std::vector<int>> e(n);
    for(int i{};i<(n);++i){
        for(int j{i+1};j<n;++j){
            (s*=base) %= mod;
            if(s>=p){
                e[i].push_back(j);
                e[j].push_back(i);
            }
        }
    }
    auto v=MIS(e);
    int N = v.size();
    if(n==N){
        std::cout<<-1<<'\n';
        return 0;
    }
    std::cout<<N+1<<'\n';
    for(int i{};i<(N-1);++i){
        std::cout<<v[i]+1<<" ";
    }
    std::cout<<v.back()+1<<'\n';
}