#include <bits/stdc++.h>
using vi = std::vector<int>;
const int NMAX = 1024;
int x[NMAX], y[NMAX], n;
bool even(int i) { return (x[i] + y[i]) % 2 == 0; }
bool odd(int i) { return !even(i); }
int main() {
  std::cin >> n;
  for (int i = 1; i <= n; i++) {
    std::cin >> x[i] >> y[i];
    x[i] += (int)1e6;
    y[i] += (int)1e6;
  }
  vi g00, g01, g10, g11;
  while (true) {
    g00.clear();
    g01.clear();
    g10.clear();
    g11.clear();
    for (int i = 1; i <= n; i++) {
      if (x[i] % 2 == 0 && y[i] % 2 == 0) {
        g00.push_back(i);
      }
      if (x[i] % 2 == 0 && y[i] % 2 == 1) {
        g01.push_back(i);
      }
      if (x[i] % 2 == 1 && y[i] % 2 == 0) {
        g10.push_back(i);
      }
      if (x[i] % 2 == 1 && y[i] % 2 == 1) {
        g11.push_back(i);
      }
    }
    if ((int)!g00.empty() + !g01.empty() + !g10.empty() + !g11.empty() == 1) {
      for (int i = 1; i <= n; i++) {
        x[i] /= 2;
        y[i] /= 2;
      }
    } else
      break;
  }
  bool wasOdd = false, wasEven = false;
  for (int i = 1; i <= n; i++) {
    if (odd(i)) wasOdd = true;
    if (even(i)) wasEven = true;
  }
  vi answ;
  if (wasOdd && wasEven) {
    answ = g00;
    answ.insert(answ.end(), (g11).begin(), (g11).end());
  } else if (wasOdd && !wasEven) {
    answ = g01;
  } else if (!wasOdd && wasEven) {
    answ = g11;
  }
  assert(0 < (int)(answ).size() && (int)(answ).size() < n);
  std::cout << (int)(answ).size() << std::endl;
  for (auto it : answ) std::cout << it << ' ';
  std::cout << std::endl;
  return 0;
}
