#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;



signed main(){
	int N;
	cin >> N;
	vector<int>x(N), y(N);
	vector<vector<int>>field(500,vector<int>(500));
	vector<vector<int>>idx(500, vector<int>(500, -1));
	vector<pair<int,int>>dir;
	for(int i = -10; i < 10 + 1; i++) {
		for(int j = -10; j < 10 + 1; j++) {
			int dist = i * i + j * j;
			if(dist < 100) {
				dir.emplace_back(i, j);
			}
		}
	}
	REP(i, N) {
		cin >> x[i] >> y[i];
		--x[i]; --y[i];
		idx[x[i]][y[i]] = i;
		for(auto[X, Y] : dir) {
			int ni = x[i] + X;
			int nj = y[i] + Y;
			if(!IN(0, ni, 500) || !IN(0, nj, 500)) continue;
			field[ni][nj]++;	
		}
	}
	set<pair<int,int>>st;
	REP(i, N) {
		//out(i, field[x[i]][y[i]]);
		st.insert({-field[x[i]][y[i]], i});
	}
	while(1) {
		auto itr = st.begin();
		if(itr->first == -1) break;
		int now = itr->second;
		//out(now, -itr->first);
		int i = x[now];
		int j = y[now];
		for(auto[X, Y] : dir) {
			int ni = i + X;
			int nj = j + Y;
			if(!IN(0, ni, 500) || !IN(0, nj, 500)) continue;
			if(idx[ni][nj] != -1 && field[ni][nj]) {
				//out(ni, nj, field[ni][nj], idx[ni][nj]);;
				auto itr = st.find({-field[ni][nj], idx[ni][nj]});
				if(itr == st.end()){
					
					continue;
				}
				st.erase(itr);
				field[ni][nj]--;
				if(field[ni][nj] && (Y || X))st.insert({-field[ni][nj], idx[ni][nj]});
			}
		}
	}
	out(st.size());
	vector<int>ans;
	while(st.size()) {
		ans.emplace_back(st.begin()->second);
		st.erase(st.begin());
	}
	REP(i,ans.size())cout << ans[i] + 1 << " \n"[i+1 == ans.size()];
}