package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

type pos struct {
	x, y, idx int
}

func calcD(a, b pos) int {
	dx := a.x - b.x
	dy := a.y - b.y
	return dx*dx + dy*dy
}

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	N := getI()
	x := make([]int, N)
	y := make([]int, N)
	const size = 510
	var a [size][size]pos
	for i := 0; i < N; i++ {
		x[i], y[i] = getI(), getI()
		a[x[i]][y[i]] = pos{x[i], y[i], i + 1}
	}
	a[0][0] = pos{-10, -10, -1}
	for x := 0; x < size; x++ {
		a[0][x] = pos{-10, -10, -1}
	}
	for x := 1; x < size; x++ {
		a[x][0] = pos{-10, -10, -1}
	}
	cnt := 0
	ans := make([]int, 0)
	for y := 1; y < size; y++ {
		for x := 1; x < size; x++ {
			dist0 := calcD(pos{x, y, 0}, a[y-1][x])
			dist1 := calcD(pos{x, y, 0}, a[y][x-1])
			if dist0 >= 100 && dist1 >= 100 {
				if a[y][x].x == 0 {
					a[y][x] = a[y][x-1]
				} else {
					cnt++
					ans = append(ans, a[y][x].idx)
				}
			} else if dist0 > dist1 {
				a[y][x] = a[y][x-1]
				a[y][x].idx = -1
			} else {
				a[y][x] = a[y-1][x]
				a[y][x].idx = -1
			}
		}
		for x := size - 2; x > 0; x-- {
			dist0 := calcD(a[y][x], a[y][x+1])
			dist1 := calcD(a[y][x], a[y][x-1])
			if dist1 < dist0 {
				a[y][x] = a[y][x+1]
				a[y][x].idx = -1
			}
		}
	}

	// for i := 0; i < size; i++ {
	// 	out(a[i])
	// }
	out(cnt)
	for _, e := range ans {
		fmt.Fprint(wr, e, " ")
		// out(e, x[e-1], y[e-1])
	}
	out()

}