import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from collections import defaultdict
from bisect import bisect

def ng():
    for px in range(x, x-11, -1):
        j = bisect(yy[px], y)
        py = yy[px][j]
        if y-yy[px][j-1] < py-y: py = yy[px][j-1]
        if (x-px)**2+(y-py)**2 < 100: return True
    return False

n = II()
xy = LLI(n)

ans = []
yy = defaultdict(lambda: [-inf, inf])
px = -1
for i, (x, y) in sorted(enumerate(xy), key=lambda x: x[1]):
    if ng(): continue
    yy[x].append(y)
    ans.append(i+1)
    if x != px: yy[x].sort()
    px = x

print(len(ans))
print(*ans)