#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

vector<pair<int,int>> v[55][55];

double dist(pair<int,int> x,pair<int,int> y){
    return sqrt((x.first-y.first)*(x.first-y.first)+(x.second-y.second)*(x.second-y.second));
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> x(n),y(n);
    vector<pair<int,int>> vv;
    map<pair<int,int>,int> mp;
    for(int i=0;i<n;i++){
        cin >> x[i] >> y[i];
        v[x[i]/10][y[i]/10].push_back({x[i],y[i]});
        vv.push_back(make_pair(x[i],y[i]));
        mp[make_pair(x[i],y[i])]=i+1;
    }
    set<pair<int,int>> st;
    vector<int> res;
    sort(vv.begin(), vv.end());
    for(int i=0;i<n;i++){
        if(st.count(vv[i]))continue;
        else{
            res.push_back(mp[vv[i]]);
            st.insert(vv[i]);
            for(auto p:v[vv[i].first/10][vv[i].second/10]){
                if(dist(vv[i],p)>10)continue;
                else{
                    st.insert(p);
                }
            }
            for(auto p:v[vv[i].first/10+1][vv[i].second/10]){
                if(dist(vv[i],p)>10)continue;
                else{
                    st.insert(p);
                }
            }
            for(auto p:v[vv[i].first/10][vv[i].second/10+1]){
                if(dist(vv[i],p)>10)continue;
                else{
                    st.insert(p);
                }
            }
        }
    }
    printf("%d\n",res.size());
    for(int i=0;i<res.size();i++){
        printf("%d ",res[i]);
    }
    printf("\n");
}