func_code_string: #include <bits/stdc++.h>   using namespace std;   int64_t mod = 1e9 + 7;   int64_t mod1 = 1e9 + 6;   int64_t power(int64_t a, int64_t b) {     if (b == 0)       return 1;     else if (b % 2 == 0)       return power((((a % mod) * (a % mod)) % mod), b / 2) % mod;     else       return ((a % mod) * (power((((a % mod) * (a % mod)) % mod), b / 2) % mod)) %              mod;   }   int32_t main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     int64_t n;     cin >> n;     int64_t a[n + 1], b[n + 1], c[n + 1], d[n + 1], e[n + 1];     for (int64_t i = 1; i <= n; ++i) cin >> a[i] >> b[i] >> c[i] >> d[i] >> e[i];     if (n <= 2) {       cout << n <<   n ;       for (int64_t i = 1; i <= n; ++i) cout << i <<   n ;       return 0;     }     bool vis[n + 1];     memset(vis, false, sizeof(vis));     for (int64_t i = 1; i <= n; ++i) {       if (vis[i]) continue;       int64_t ch = 0;       for (int64_t j = 1; j <= n; ++j) {         if (i == j) continue;         for (int64_t k = j + 1; k <= n; ++k) {           if (i == k or k == j) continue;           int64_t s =               (a[j] - a[i]) * (a[k] - a[i]) + (b[j] - b[i]) * (b[k] - b[i]) +               (c[j] - c[i]) * (c[k] - c[i]) + (d[j] - d[i]) * (d[k] - d[i]) +               (e[j] - e[i]) * (e[k] - e[i]);           if (s > 0) {             ch = 1;             break;           }         }         if (ch) break;       }       if (ch == 0) {         cout << 1 <<   n ;         cout << i;         return 0;       }     }     cout << 0;   }   