#include // #include // #include using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using vi = vector; using vvi = vector; using vvvi = vector; using ve = vector>; using vb = vector; using vvb = vector; #define rep(i,n) for(ll i = 0;i < (ll)n;i++) #define ALL(x) (x).begin(),(x).end() #define sz(c) ((ll)(c).size()) #define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin()) #define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin()) // #define MOD 1000000007 #define MOD 998244353 templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,vector&v){for(int i = 0;i < v.size();i++)os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.first>>p.second;return is;} template inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;} template inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;} ld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));} int main(){ ios_base::sync_with_stdio(0), cin.tie(0); int n;cin >> n; vi a(n);cin >> a; vi base; vvi idx; rep(i,n){ int e = a[i]; vi k; rep(j,sz(base)){ int b = base[j]; if(chmin(e,e^b)){ for(auto au : idx[j])k.emplace_back(au); } } k.emplace_back(i); if(e){ base.emplace_back(e); idx.emplace_back(k); }else{ vb res(n); for(auto au : k){ res[au] = !res[au]; } vi ans; rep(i,n)if(res[i])ans.emplace_back(i+1); cout << sz(ans) << "\n"; cout << ans << "\n"; return 0; } } cout << "-1\n"; return 0; }