func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = (int)1e3 + 5;   const int INF = (int)1e9 + 7;   int x[N], y[N];   int n;   map<pair<int, int>, int> id;   vector<pair<int, int> > g[2][2];   int dist(int i, int j) {     return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);   }   void calc(vector<pair<int, int> > g[2][2]) {     bool flag = 0;     int sz00 = (int)g[0][0].size();     int sz11 = (int)g[1][1].size();     int sz01 = (int)g[0][1].size();     int sz10 = (int)g[1][0].size();     int fx, fy;     if (sz00 == n) {       flag = 1, fx = 0, fy = 0;     }     if (sz11 == n) {       flag = 1, fx = 1, fy = 1;     }     if (sz01 == n) {       flag = 1, fx = 0, fy = 1;     }     if (sz10 == n) {       flag = 1, fx = 1, fy = 0;     }     if (flag) {       vector<pair<int, int> > nw[2][2];       for (auto x : g[fx][fy]) {         int a = x.first, b = x.second;         a /= 2, b /= 2;         id[{a, b}] = id[{x.first, x.second}];         nw[abs(a) % 2][abs(b) % 2].push_back({a, b});       }       calc(nw);     }     if (sz00 + sz11 && sz01 + sz10) {       cout << sz00 + sz11 << endl;       for (pair<int, int> c : g[0][0]) {         cout << id[c] <<    ;       }       for (pair<int, int> c : g[1][1]) {         cout << id[c] <<    ;       }       exit(0);     }     if (sz00 && sz11) {       cout << sz00 << endl;       for (pair<int, int> c : g[0][0]) {         cout << id[c] <<    ;       }       exit(0);     }     if (sz01 && sz10) {       cout << sz01 << endl;       for (pair<int, int> c : g[0][1]) {         cout << id[c] <<    ;       }       exit(0);     }   }   int main() {     cin >> n;     for (int i = 1; i <= n; i++) {       scanf( %d%d , &x[i], &y[i]);       x[i] += 1e6, y[i] += 1e6;       g[abs(x[i]) % 2][abs(y[i]) % 2].push_back({x[i], y[i]});       id[{x[i], y[i]}] = i;     }     calc(g);   }   