#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, x[N], y[N];
bool check() {
  for (int i = 1; i < n; i++) {
    if (x[i] % 2) return true;
    if (y[i] % 2) return true;
  }
  return false;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]);
  for (int i = 1; i < n; i++) x[i] -= x[0], y[i] -= y[0];
  while (!check()) {
    for (int i = 1; i < n; i++) x[i] /= 2, y[i] /= 2;
  }
  bool chk = false;
  for (int i = 1; i < n; i++) {
    if ((x[i] + y[i]) % 2) chk = true;
  }
  if (chk) {
    int cnt = 0;
    for (int i = 1; i < n; i++) {
      if ((x[i] + y[i]) % 2) cnt++;
    }
    printf("%d\n", cnt);
    for (int i = 1; i < n; i++) {
      if ((x[i] + y[i]) % 2) printf("%d ", i + 1);
    }
    printf("\n");
  } else {
    int cnt = 0;
    for (int i = 1; i < n; i++) {
      if (x[i] % 2) cnt++;
    }
    printf("%d\n", cnt);
    for (int i = 1; i < n; i++) {
      if (x[i] % 2) printf("%d ", i + 1);
    }
    printf("\n");
  }
  return 0;
}
