Five Dimensional Points CodeForces - 850A

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 and is acute (i.e. strictly less than ). Otherwise, the point is called good.

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

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.

Example
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 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:

We can see that all angles here are acute, so no points are good.

题意：有n个五维空间内的点，如果其中三个点A，B，C，向量AB,AC的夹角不大于90°，则点A是“bad”的否则是“good”。题目让我们输出good的点。

/*从2，3维空间超过5，7个点时不存在“good”的点，可以简单推知五维空间内，
超过11个点时不存在“good”的点，那么点数小于11时暴力，大于11时输出0.*/
#include<iostream>

#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
const int MAXN=1005;
struct Node
{
    int a,b,c,d,e;
} node[MAXN];
bool pend(Node A, Node B, Node C)
{
    Node AB,AC;
    AB.a=B.a-A.a;
    AB.b=B.b-A.b;
    AB.c=B.c-A.c;
    AB.d=B.d-A.d;
    AB.e=B.e-A.e;
    AC.a=C.a-A.a;
    AC.b=C.b-A.b;
    AC.c=C.c-A.c;
    AC.d=C.d-A.d;
    AC.e=C.e-A.e;
    if(AB.a*AC.a+AB.b*AC.b+AB.c*AC.c+AB.d*AC.d+AB.e*AC.e<=0) return 0;
    return 1;
}
int main()
{
    int n;
    while(cin>>n)
    {

        vector<int> res;
        for(int i=0; i<n; i++)
        {
            scanf("%d %d %d %d %d", &node[i].a, &node[i].b, &node[i].c, &node[i].d,&node[i].e);
        }
        if(n==1)
        {
            printf("%d\n%d\n", 1, 1);
            continue;
        }
        else if(n==2)
        {
            printf("%d\n%d\n%d\n", 2, 1, 2);
            continue;
        }
        else if(n>11)
        {
            printf("%d\n", 0);
            continue;
        }
        bool flag;
        for(int i=0; i<n; i++)
        {
            flag=0;
            for(int j=0; j<n; j++)
            {
                for(int k=j+1; k<n; k++)
                {
                    if(pend(node[i], node[j], node[k]))
                    {
                        flag=1;
                        j=n+1;
                        break;
                    }
                }
            }
            if(!flag) res.push_back(i);
        }
        int l=res.size();
        printf("%d\n", l);
        for(int i=0; i<l; i++)
            printf("%d\n", res[i]+1);
    }
    return 0;
}