#include <bits/stdc++.h>
using namespace std;
const int maxN = 1000 + 100;
long long n, x[maxN], y[maxN];
long long a[maxN][maxN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
  long long g = (1ll << 60);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < i; j++) {
      long long dis =
          (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
      g = min(g, dis & -dis);
    }
  vector<int> a;
  a.push_back(0);
  for (int i = 1; i < n; i++) {
    long long dis =
        (x[i] - x[0]) * (x[i] - x[0]) + (y[i] - y[0]) * (y[i] - y[0]);
    if ((dis & -dis) > g) a.push_back(i);
  }
  cout << (int)a.size() << endl;
  for (auto o : a) cout << o + 1 << ' ';
  cout << endl;
  return 0;
}
