#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 1000005;
int n;
int x[N], y[N];
int ans[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
  for (int i = 2; i <= n; i++) {
    x[i] -= x[1];
    y[i] -= y[1];
  }
  x[1] = y[1] = 0;
  while (1) {
    int nn = 0;
    for (int i = 1; i <= n; i++) {
      ans[i] = ((x[i] + y[i]) % 2 + 2) % 2;
      nn += ans[i];
    }
    if (0 < nn && nn < n) {
      cout << nn << endl;
      for (int i = 1; i <= n; i++)
        if (ans[i]) cout << i << " ";
      cout << endl;
      return 0;
    }
    nn = 0;
    for (int i = 1; i <= n; i++) {
      ans[i] = (x[i] % 2 + 2) % 2;
      nn += ans[i];
    }
    if (0 < nn && nn < n) {
      cout << nn << endl;
      for (int i = 1; i <= n; i++)
        if (ans[i]) cout << i << " ";
      cout << endl;
      return 0;
    }
    for (int i = 1; i <= n; i++) {
      x[i] /= 2;
      y[i] /= 2;
    }
  }
}
