#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
struct data {
  int id;
  int x;
  int y;
  void operator/=(int c) {
    x /= c;
    y /= c;
  }
} pre[N];
vector<data> buc[4];
int mabs(int x) { return (x < 0) ? -x : x; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &pre[i].x, &pre[i].y);
    pre[i].id = i;
  }
  for (int i = n; i >= 1; i--) {
    pre[i].x -= pre[1].x;
    pre[i].y -= pre[1].y;
    pre[i].x = mabs(pre[i].x);
    pre[i].y = mabs(pre[i].y);
  }
  while (1) {
    int cnt = 0;
    for (int i = 1; i <= n; i++)
      if ((pre[i].x & 1) || (pre[i].y & 1)) cnt++;
    if (cnt) break;
    for (int i = 1; i <= n; i++) pre[i].x /= 2, pre[i].y /= 2;
  }
  for (int i = 1; i <= n; i++) {
    int id = ((pre[i].x & 1) << 1) + (pre[i].y & 1);
    buc[id].push_back(pre[i]);
  }
  if (buc[1].size() + buc[2].size() != 0) {
    printf("%d\n", buc[1].size() + buc[2].size());
    for (int i = 0; i < buc[1].size(); i++) printf("%d ", buc[1][i].id);
    for (int i = 0; i < buc[2].size(); i++) printf("%d ", buc[2][i].id);
  } else {
    printf("%d\n", buc[3].size());
    for (int i = 0; i < buc[3].size(); i++) printf("%d ", buc[3][i].id);
  }
  return 0;
}
