#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000 + 7;
int x[MAX_N], y[MAX_N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x[i], &y[i]);
  }
  vector<int> ans;
  while (true) {
    ans.clear();
    for (int i = 0; i < n; i++) {
      if ((x[i] + y[i]) & 1) {
        ans.push_back(i + 1);
      }
    }
    if ((int)ans.size() != n && (int)ans.size() != 0) {
      break;
    } else {
      for (int i = 0; i < n; i++) {
        if ((x[i] + y[i]) & 1) {
          y[i]++;
        }
        int x2 = (x[i] + y[i]) / 2;
        int y2 = (x[i] - y[i]) / 2;
        x[i] = x2;
        y[i] = y2;
      }
    }
  }
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < (int)ans.size(); i++) {
    printf("%d%c", ans[i], " \n"[i == (int)ans.size() - 1]);
  }
  return 0;
}
