#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

const int L = 500;
int n;

vector<int> solve1(vector<vector<int>> exist) {
  vector<int> ans;
  REP(j, L) REP(i, L) {
    if (exist[i][j] != -1) {
      ans.emplace_back(exist[i][j]);
      FOR(y, -9, 10) FOR(x, -9, 10) {
        if (y * y + x * x < 100 && 0 <= i + y && i + y < L && 0 <= j + x && j + x < L) {
          exist[i + y][j + x] = -1;
        }
      }
    }
  }
  return n <= ans.size() * 90 ? ans : vector<int>();
}

vector<int> solve2(vector<vector<int>> exist) {
  vector<int> ans;
  for (int j = L - 1; j >= 0; --j) REP(i, L) {
    if (exist[i][j] != -1) {
      ans.emplace_back(exist[i][j]);
      FOR(y, -9, 10) FOR(x, -9, 10) {
        if (y * y + x * x < 100 && 0 <= i + y && i + y < L && 0 <= j + x && j + x < L) {
          exist[i + y][j + x] = -1;
        }
      }
    }
  }
  return n <= ans.size() * 90 ? ans : vector<int>();
}

vector<int> solve3(vector<vector<int>> exist) {
  vector<int> ans;
  REP(j, L) for (int i = L - 1; i >= 0; --i) {
    if (exist[i][j] != -1) {
      ans.emplace_back(exist[i][j]);
      FOR(y, -9, 10) FOR(x, -9, 10) {
        if (y * y + x * x < 100 && 0 <= i + y && i + y < L && 0 <= j + x && j + x < L) {
          exist[i + y][j + x] = -1;
        }
      }
    }
  }
  return n <= ans.size() * 90 ? ans : vector<int>();
}

vector<int> solve4(vector<vector<int>> exist) {
  vector<int> ans;
  for (int j = L - 1; j >= 0; --j) for (int i = L - 1; i >= 0; --i) {
    if (exist[i][j] != -1) {
      ans.emplace_back(exist[i][j]);
      FOR(y, -9, 10) FOR(x, -9, 10) {
        if (y * y + x * x < 100 && 0 <= i + y && i + y < L && 0 <= j + x && j + x < L) {
          exist[i + y][j + x] = -1;
        }
      }
    }
  }
  return n <= ans.size() * 90 ? ans : vector<int>();
}

int main() {
  cin >> n;
  vector exist(L, vector(L, -1));
  REP(i, n) {
    int x, y; cin >> x >> y; --x; --y;
    exist[y][x] = i;
  }
  vector<int> ans;
  if (ans.empty()) ans = solve1(exist);
  if (ans.empty()) ans = solve2(exist);
  if (ans.empty()) ans = solve3(exist);
  if (ans.empty()) ans = solve4(exist);
  int k = ans.size();
  assert(n <= k * 90);
  cout << k << '\n';
  REP(i, k) cout << ans[i] + 1 << " \n"[i + 1 == k];
  return 0;
}