func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MAXN = 1e5 + 5;   const long long INF = 1e18;   const long long LIMIT = 1500000LL * 1500000LL;   vector<int> V;   int ans[MAXN];   struct node {     long long x, y, pos;     long long dis() { return x * x + y * y; }   };   node p[MAXN];   bool cmp(node A, node B) { return A.dis() > B.dis(); }   node operator+(const node &A, const node &B) {     node ans = A;     ans.x += B.x;     ans.y += B.y;     return ans;   }   node operator-(const node &A, const node &B) {     node ans = A;     ans.x -= B.x;     ans.y -= B.y;     return ans;   }   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     int n;     cin >> n;     for (int i = 0; i < n; i++) cin >> p[i].x >> p[i].y, p[i].pos = i;     node cur{0, 0, 0};     for (int i = n - 1; i >= 0; i--) {       if (cmp(cur - p[i], cur + p[i]))         cur = cur + p[i], ans[i] = 1;       else         cur = cur - p[i], ans[i] = -1;     }     for (int i = 0; i < n; i++) cout << ans[i] <<    ;     return 0;   }   