func_code_string: #include <bits/stdc++.h>   #pragma comment(linker,  /STACK:256000000 )   using namespace std;   int t;   void solve();   struct Node {     long long q, w, e, r, t;   };   int n;   vector<Node> a;   vector<bool> ans;   int res = 0;   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     t = 1;     for (int i = 0; i < t; ++i) {       solve();     }   }   void solve() {     cin >> n;     a.resize(n);     ans.resize(n);     for (int i = 0; i < int(n); ++i) {       cin >> a[i].q >> a[i].w >> a[i].e >> a[i].r >> a[i].t;     }     if (n > 66) {       cout << 0;       return;     }     for (int i = 0; i < int(n); ++i) {       for (int j = (0); j <= int(n - 1); ++j) {         for (int k = (j + 1); k <= int(n - 1); ++k) {           if (j == i || k == i) {             continue;           }           if ((a[j].q - a[i].q) * (a[k].q - a[i].q) +                   (a[j].w - a[i].w) * (a[k].w - a[i].w) +                   (a[j].e - a[i].e) * (a[k].e - a[i].e) +                   (a[j].r - a[i].r) * (a[k].r - a[i].r) +                   (a[j].t - a[i].t) * (a[k].t - a[i].t) >               0) {             ans[i] = true;             break;           }         }         if (ans[i]) break;       }       if (!ans[i]) res++;     }     cout << res << endl;     for (int i = 0; i < int(n); ++i) {       if (!ans[i]) {         cout << i + 1 << endl;       }     }   }   