#include <bits/stdc++.h>
using namespace std;
const int maxs = 1e5 + 7;
int k[maxs][23], good[maxs];
int h, ans, sum;
int i, u, t, j;
int main() {
  scanf("%d", &h);
  for (i = 1; i <= h; i++) {
    for (u = 1; u <= 5; u++) {
      scanf("%d", &k[i][u]);
    }
  }
  for (i = 1; i <= h; i++) {
    for (u = 1; u <= h; u++) {
      if (i != u) {
        for (t = u + 1; t <= h; t++) {
          if (i != t) {
            sum = 0;
            for (j = 1; j <= 5; j++) {
              sum = sum + (k[u][j] - k[i][j]) * (k[t][j] - k[i][j]);
            }
            if (sum > 0) {
              goto nxt;
            }
          }
        }
      }
    }
    good[++ans] = i;
  nxt:;
  }
  printf("%d\n", ans);
  for (t = 1; t <= ans; t++) {
    printf("%d\n", good[t]);
  }
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxs = 1e5 + 7;
int k[maxs][23], good[maxs];
int h, ans, sum;
int i, u, t, j;
int main() {
  scanf("%d", &h);
  for (i = 1; i <= h; i++) {
    for (u = 1; u <= 5; u++) {
      scanf("%d", &k[i][u]);
    }
  }
  for (i = 1; i <= h; i++) {
    for (u = 1; u <= h; u++) {
      if (i != u) {
        for (t = u + 1; t <= h; t++) {
          if (i != t) {
            sum = 0;
            for (j = 1; j <= 5; j++) {
              sum = sum + (k[u][j] - k[i][j]) * (k[t][j] - k[i][j]);
            }
            if (sum > 0) {
              goto nxt;
            }
          }
        }
      }
    }
    good[++ans] = i;
  nxt:;
  }
  printf("%d\n", ans);
  for (t = 1; t <= ans; t++) {
    printf("%d\n", good[t]);
  }
  return 0;
}

```