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.
/*
Keep solving problems.
*/

import java.math.BigInteger;
import java.util.*;
import java.io.*;

public class CFA {
    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    private static final long MOD = 1000 * 1000 * 1000 + 7;
    private static final int[] dx = {0, -1, 0, 1};
    private static final int[] dy = {1, 0, -1, 0};
    private static final String yes = "YES";
    private static final String no = "NO";

    int n;
    int m = 5;
    int[][] mat;
    void solve() throws IOException {
        n = nextInt();
        mat = new int[n][];
        for (int i = 0; i < n; i++) {
            mat[i] = nextIntArr(m);
        }

        if (n == 1) {
            outln(1);
            outln(1);
            return;
        }

        int a = -1;
        int b = -1;
        int dist = Integer.MAX_VALUE;
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                int tmp = findDist(i, j);
                if (dist > tmp) {
                    a = i;
                    b = j;
                    dist = tmp;
                }
            }
        }

        List<Integer> res = new ArrayList<>();
        if (valid(a)) {
            res.add(a);
        }
        if (valid(b)) {
            res.add(b);
        }

        outln(res.size());
        for (int i = 0; i < res.size(); i++) {
            outln(res.get(i) + 1);
        }
    }

    boolean valid(int cur) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i != cur && i != j && j != cur) {
                    int[] vec1 = new int[m];
                    int[] vec2 = new int[m];
                    for (int k = 0; k < m; k++) {
                        vec1[k] = mat[i][k] - mat[cur][k];
                        vec2[k] = mat[j][k] - mat[cur][k];
                    }

                    int sum = 0;
                    for (int k = 0; k < m; k++) {
                        sum += vec1[k] * vec2[k];
                    }
                    if (sum > 0) {
                        return false;
                    }
                }
            }
        }

        return true;
    }

    int findDist(int i, int j) {
        int res = 0;
        for (int k = 0; k < m; k++) {
            int dk = mat[i][k] - mat[j][k];
            res += dk * dk;
        }
        return res;
    }

    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }

    int gcd(int a, int b) {
        while(a != 0 && b != 0) {
            int c = b;
            b = a % b;
            a = c;
        }
        return a + b;
    }

    private void outln(Object o) {
        out.println(o);
    }
    private void out(Object o) {
        out.print(o);
    }
    public CFA() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new CFA();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}

