#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long infll = 1e18 + 5;
const int mod = 1e9 + 7;
template <typename T>
void gi(T &ret) {
  ret = 0;
  char inp = getchar();
  bool isNeg = 0;
  while (inp < '0' || inp > '9') {
    if (inp == '-') isNeg = 1;
    inp = getchar();
  }
  while ('0' <= inp && inp <= '9') {
    ret = (ret << 3) + (ret << 1) + (inp - '0');
    inp = getchar();
  }
  if (isNeg) ret = -ret;
}
const int MAXN = 1000;
int n;
int x[MAXN + 5];
int y[MAXN + 5];
void readInput() {
  gi(n);
  for (int i = 0; i < n; ++i) {
    gi(x[i]);
    gi(y[i]);
  }
}
int findParity(int idx) { return abs(x[idx] % 2) * 2 + abs(y[idx] % 2); }
bool isValid() {
  for (int i = 1; i < n; ++i) {
    if (findParity(i) != findParity(i - 1)) return true;
  }
  return false;
}
void makeSmaller() {
  int dx = abs(x[0] % 2);
  int dy = abs(y[0] % 2);
  for (int i = 0; i < n; ++i) {
    x[i] += dx;
    y[i] += dy;
    x[i] = x[i] >> 1;
    y[i] = y[i] >> 1;
  }
}
vector<int> group[4];
void groupThem() {
  for (int i = 0; i < n; ++i) {
    group[findParity(i)].push_back(i + 1);
  }
}
vector<int> solution;
void appendSolution(vector<int> &vec) {
  for (auto v : vec) {
    solution.push_back(v);
  }
}
void solve() {
  while (!isValid()) {
    makeSmaller();
  }
  groupThem();
  if ((group[0].size() || group[3].size()) &&
      (group[1].size() || group[2].size())) {
    appendSolution(group[0]);
    appendSolution(group[3]);
  } else if (group[0].size() && group[3].size()) {
    appendSolution(group[0]);
  } else if (group[1].size() && group[2].size()) {
    appendSolution(group[1]);
  } else {
    assert(false);
  }
  printf("%d\n", solution.size());
  printf("%d", solution[0]);
  for (int i = 1; i < solution.size(); ++i) {
    printf(" %d", solution[i]);
  }
  printf("\n");
}
int main() {
  readInput();
  solve();
  return 0;
}
