#include<bits/stdc++.h>
#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 rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==v.size()-1?']':','); return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int n;
    cin >> n;
    vi x(n),y(n);
    rep(i,n) cin >> x[i] >> y[i];
    vvi v(500,vi(500,-1));
    rep(i,n) v[--x[i]][--y[i]] = i;
    vi ans(n,1);
    rep(i,n) {
        if(!ans[i]) continue;
        for(int dx = -10; dx <= 10; dx++) {
            for(int dy = -10; dy <= 10; dy++) {
                if(dx*dx + dy*dy >= 100) continue;
                if(dx == 0 and dy == 0) continue;
                int nx = x[i]+dx,ny = y[i]+dy;
                if(nx < 0 or nx >= 500 or ny < 0 or ny >= 500) continue;
                int now = v[nx][ny];
                if(now != -1) ans[now] = 0;
            }
        }
    }
    int cnt = 0;
    rep(i,n) if(ans[i]) cnt++;
    cout << cnt << '\n';
    rep(i,n) if(ans[i]) cout << i+1 << ' ';
    cout << endl;
}