import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, core.stdc.stdlib, std.datetime;

void main() {
    auto N = readln.chomp.to!int;
    auto A = iota(N).map!(i => readln.split.map!(to!int).array ~ i.to!int).array;

    int[] ans;

    A.sort!((a, b) => a[0] == b[0] ? a[1] < b[1] : a[0] < b[0]);
    ans = solve(N, A);
    if (!ans.empty) {
        ans.length.writeln;
        ans.map!(a => (a + 1).to!string).join(" ").writeln;
        return;
    }

    A.sort!((a, b) => a[0] == b[0] ? a[1] > b[1] : a[0] > b[0]);
    ans = solve(N, A);
    if (!ans.empty) {
        ans.length.writeln;
        ans.map!(a => (a + 1).to!string).join(" ").writeln;
        return;
    }

    A.sort!((a, b) => a[1] == b[1] ? a[0] < b[0] : a[1] < b[1]);
    ans = solve(N, A);
    if (!ans.empty) {
        ans.length.writeln;
        ans.map!(a => (a + 1).to!string).join(" ").writeln;
        return;
    }

    A.sort!((a, b) => a[1] == b[1] ? a[0] > b[0] : a[1] > b[1]);
    ans = solve(N, A);
    if (!ans.empty) {
        ans.length.writeln;
        ans.map!(a => (a + 1).to!string).join(" ").writeln;
        return;
    }
}

int[] solve(int N, const int[][] A) {
    int[] ans;

    outer: foreach (i; 0..N) {
        foreach (a; ans) if ((A[i][0] - A[a][0])^^2 + (A[i][1] - A[a][1])^^2 < 100) {
            continue outer;
        }
        ans ~= i;
    }

    if (ans.length * 90 >= N) {
        return ans;
    } else {
        return [];
    }
}