#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 1002;
int n;
struct Point {
  int x, y;
};
Point v[N_MAX];
vector<int> a[2][2];
vector<int> ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> v[i].x >> v[i].y;
    v[i].x += 1000000;
    v[i].y += 1000000;
  }
  if (n == 2) {
    cout << "1\n1\n";
    return 0;
  }
  while (true) {
    for (int i = 0; i <= 1; i++)
      for (int j = 0; j <= 1; j++) a[i][j].clear();
    for (int i = 1; i <= n; i++) a[v[i].x % 2][v[i].y % 2].push_back(i);
    int cnt = 0;
    for (int i = 0; i <= 1; i++)
      for (int j = 0; j <= 1; j++)
        if (!a[i][j].empty()) cnt++;
    if (cnt >= 2) {
      ans.clear();
      for (int i = 0; i <= 1; i++)
        for (int k : a[i][i]) ans.push_back(k);
      if (ans.empty() || ans.size() == n) {
        ans.clear();
        if (!a[0][0].empty() && !a[1][1].empty()) {
          for (int k : a[0][0]) ans.push_back(k);
        } else {
          for (int k : a[0][1]) ans.push_back(k);
        }
      }
      cout << ans.size() << "\n";
      for (int i : ans) cout << i << " ";
      cout << "\n";
      return 0;
    }
    for (int i = 1; i <= n; i++) {
      v[i].x /= 2;
      v[i].y /= 2;
    }
  }
  return 0;
}
