//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  ll sz=500;
  auto v=vec(sz+20,sz+20,-1LL);
  vector<ll>ax(n),ay(n);
  rep(i,0,n){
    ll x,y;cin>>x>>y;x--;y--;
    ax[i]=x,ay[i]=y;
    v[x][y]=i;
  }
  vector<ll>sx,sy;
  rep(i,-9,10)rep(j,-9,10){
    if(i==0&&j==0)continue;
    if(i*i+j*j<100)sx.PB(i),sy.PB(j);
  }
  ll m=sx.size();
  vector<ll>d(n);
  rep(i,0,sz)rep(j,0,sz){
    if(v[i][j]==-1)continue;
    rep(o,0,m){
      ll x=i+sx[o],y=j+sy[o];
      if(x<0||y<0||v[x][y]==-1)continue;
      d[v[x][y]]++;
    }
  }
  //debug(d,n);
  vector<ll>ret;
  priority_queue<P,vector<P>,greater<P>>que;
  rep(i,0,n)que.emplace(d[i],i);
  ll lim=(n+89)/90;
  while(!que.empty()&&ret.size()<lim){
    auto p=que.top();
    que.pop();
    ll x=ax[p.se],y=ay[p.se];
    //cout<<x spa y spa d[p.se] spa v[x][y]<<endl;
    if(v[x][y]==-1)continue;
    v[x][y]=-1;
    ret.PB(p.se+1);
    rep(i,0,m){
      ll nx=x+sx[i],ny=y+sy[i];
      if(nx<0||ny<0||v[nx][ny]==-1)continue;
      v[nx][ny]=-1;
      rep(j,0,m){
        ll nx2=nx+sx[j],ny2=ny+sy[j];
        if(nx2<0||ny2<0||v[nx2][ny2]==-1)continue;
        que.emplace(--d[v[nx2][ny2]],v[nx2][ny2]);
      }
    }
  }
  cout<<ret.size()<<endl;
  debug(ret,ret.size());
  return 0;
}