You are given set of n points in 5-dimensional space. The points are labeled from 1 to n. No two points coincide.

We will call point a bad if there are different points b and c, not equal to a, from the given set such that angle between vectors <image> and <image> is acute (i.e. strictly less than <image>). Otherwise, the point is called good.

The angle between vectors <image> and <image> in 5-dimensional space is defined as <image>, where <image> is the scalar product and <image> is length of <image>.

Given the list of points, print the indices of the good points in ascending order.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 103) — the number of points.

The next n lines of input contain five integers ai, bi, ci, di, ei (|ai|, |bi|, |ci|, |di|, |ei| ≤ 103) — the coordinates of the i-th point. All points are distinct.

Output

First, print a single integer k — the number of good points.

Then, print k integers, each on their own line — the indices of the good points in ascending order.

Examples

Input

6
0 0 0 0 0
1 0 0 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 1


Output

1
1


Input

3
0 0 1 2 0
0 0 9 2 0
0 0 5 9 0


Output

0

Note

In the first sample, the first point forms exactly a <image> angle with all other pairs of points, so it is good.

In the second sample, along the cd plane, we can see the points look as follows:

<image>

We can see that all angles here are acute, so no points are good.
from sys import stdin
from functools import reduce
from operator import mul
from math import acos, degrees


def vector(p1, p2):
    tem = [0] * 5
    for i1 in range(5):
        tem[i1] = p2[i1] - p1[i1]
    return tem


def get_ang(p1, p2):
    dot = sum(p1[i1] * p2[i1] for i1 in range(5))
    le1 = sum([p1[i1] ** 2 for i1 in range(5)]) ** .5
    le2 = sum([p2[i1] ** 2 for i1 in range(5)]) ** .5
    return degrees(acos(dot / (le1 * le2)))


rints = lambda: [int(x) for x in stdin.readline().split()]
rints_2d = lambda n: [rints() for _ in range(n)]
n = int(input())
a, out = rints_2d(n), []
if n > 11:
    print(0)
    exit()

for i in range(n):
    flag = 1
    for j in range(n):
        if i != j:
            i_j = vector(a[i], a[j])
            for k in range(n):
                if k not in [i, j]:
                    i_k = vector(a[i], a[k])
                    if get_ang(i_j, i_k) < 90:
                        flag = 0
                        break
            if not flag:
                break
    if flag:
        out.append(i + 1)

print('%d\n%s' % (len(out), ' '.join(map(str, out))))
