#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  vector<bitset<60>> a(n);
  rep(i, n) {
    ll x;
    cin >> x;
    a[i] = x;
  }
  vector<vector<ll>> b(n);
  rep(i, n) b[i].push_back(i);
  rep(j, 60) {
    ll k = -1;
    rep(i, n) {
      if (a[i].test(j)) {
        k = i;
        break;
      }
    }
    if (k == -1)
      continue;
    rep(i, n) if (i != k && a[i].test(j)) {
      a[i] ^= a[k];
      b[i].push_back(k);
    }
  }
  rep(k, n) if (a[k] == 0) {
    sort(b[k].begin(), b[k].end());
    cout << b[k].size() << '\n';
    rep(i, b[k].size()) cout << (i ? " " : "") << b[k][i] + 1;
    cout << '\n';
    return;
  }
  cout << "-1\n";
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}