#include <bits/stdc++.h>
using namespace std;
long long N;
long long P[2000][5];
long long A[5];
long long B[5];
long long PP;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 5; j++) cin >> P[i][j];
  }
  if (N >= 20) {
    cout << 0 << endl;
    return 0;
  }
  if (N <= 2) {
    cout << N << "\n";
    for (int i = 1; i <= N; i++) cout << i << "\n";
    return 0;
  }
  for (int i = 0; i < N; i++) {
    bool flag = true;
    for (int j = 0; j < N; j++) {
      if (flag == true && j != i) {
        for (int k = 0; k < N; k++) {
          if (k != j && k != i) {
            PP = 0;
            for (int h = 0; h < 5; h++) {
              A[h] = P[j][h] - P[i][h];
              B[h] = P[k][h] - P[i][h];
              PP += A[h] * B[h];
            }
            if (PP > 0) {
              flag = false;
              break;
            }
          }
        }
      } else {
        if (flag == false) break;
      }
    }
    if (flag == true) {
      cout << 1 << "\n" << i + 1 << "\n";
      return 0;
    }
  }
  cout << 0 << endl;
  return 0;
}
