#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<long long, long long> > p(n);
  vector<int> ans;
  int ad = 1007000;
  for (int i = (0); i < (n); i++) {
    int x, y;
    cin >> x >> y;
    p[i] = {x + ad, y + ad};
  }
  int cou = 0;
  while (1) {
    if (cou == 4) {
      for (int i = (0); i < (n); i++) {
        p[i].first += 11;
        p[i].second += 11;
      }
    }
    int c = 0;
    for (int i = (0); i < (n); i++) {
      if ((p[i].first + p[i].second) % 2) c++;
    }
    if (c == n || c == 0) {
      for (int i = (0); i < (n); i++) {
        int x, y;
        x = p[i].first;
        y = p[i].second;
        p[i].first = (x + y);
        p[i].second = (x - y);
      }
      for (int i = (0); i < (n); i++) {
        p[i].first >>= 1;
        p[i].second >>= 1;
      }
    } else {
      for (int i = (0); i < (n); i++) {
        if ((p[i].first + p[i].second) % 2) ans.push_back(i + 1);
      }
      break;
    }
    cou++;
  }
  cout << ans.size() << endl;
  for (int e : ans) {
    cout << e << ' ';
  }
}
