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.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Anand Iyer
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public static boolean angle(TaskC.Point a, TaskC.Point b) {
            double amag = a.mag();
            double bmag = b.mag();
            double abmag = a.v * b.v + a.w * b.w + a.x * b.x + a.y * b.y + a.z * b.z;
            double angle = Math.toDegrees(Math.acos(abmag / (amag * bmag)));
            if (angle < 90) {
                return true;
            }
            return false;
        }

        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.nextInt();
            if (n > 11) {
                out.println("0");
            } else {
                HashSet<Integer> good = new HashSet<Integer>();
                ArrayList<TaskC.Point> arr = new ArrayList<>();
                for (int i = 0; i < n; i++) {
                    int a = in.nextInt();
                    int b = in.nextInt();
                    int c = in.nextInt();
                    int d = in.nextInt();
                    int e = in.nextInt();
                    TaskC.Point p = new TaskC.Point(a, b, c, d, e);
                    arr.add(p);
                }
                for (int i = 0; i < n; i++) {
                    boolean b = true;
                    for (int j = 0; j < n; j++) {
                        for (int k = 0; k < n; k++) {
                            if (i != j && i != k && j != k) {
                                TaskC.Point one = arr.get(j);
                                TaskC.Point two = arr.get(k);
                                TaskC.Point three = arr.get(i);
                                TaskC.Point lol2 = new TaskC.Point(one.v - three.v, one.w - three.w, one.x - three.x, one.y - three.y, one.z - three.z);
                                TaskC.Point lol1 = new TaskC.Point(two.v - three.v, two.w - three.w, two.x - three.x, two.y - three.y, two.z - three.z);
                                if (angle(lol1, lol2)) {
                                    b = false;
                                }
                            }
                        }
                    }
                    if (b) {
                        good.add(i + 1);
                    }
                }
                if (good.size() == 0) {
                    out.println("0");
                } else {
                    out.println(good.size());
                    for (int i : good) {
                        out.println(i);
                    }
                }
            }
        }

        public static class Point {
            int v;
            int w;
            int x;
            int y;
            int z;

            public Point(int a, int b, int c, int d, int e) {
                v = a;
                w = b;
                x = c;
                y = d;
                z = e;
            }

            public double mag() {
                return Math.sqrt(v * v + w * w + x * x + y * y + z * z);
            }

        }

    }

    static class FastScanner {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public FastScanner(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

