#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <time.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

ll dist(ll x, ll y){
	return x*x + y*y;
}

int main(){
	ll n; cin >> n;
	vpl v(n);
	vector<vpl> ls(501);
	ll cn = 0;
	rep(i,n){
		cin >> v[i].first >> v[i].second;
		ls[v[i].first].emplace_back(v[i].second,i);
	}
	rep(i,501) sort(all(ls[i]));
	vl ans;
	vl memo(501,-10);
	ll K = (n + 89) / 90;
	REP(offset,1,10){
		ans.clear();
		for(int i=offset; i<=500; i++){
			ll mn = -inf;
			for(auto j : ls[i]){
				if(mn + 10 > j.first) continue;
				bool f = true;
				for(int k=j.first-10; k<=j.first+10; k++){
					if(k <= 0 || k > 500) continue;
					if(dist(abs(j.first-k), i-memo[k]) < 100){
						f = false;
						break;
					}
				}
				if(f){
					ans.push_back(j.second);
					mn = j.first;
					memo[j.first] = i;
				}
			}
		}
		if(ans.size() >= K) break;
	}
	cout << ans.size() << "\n";
	for(auto i : ans) cout << i+1 << " ";
	cout << "\n";
}