func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 1e3 + 5;   const int mod = 998244353;   map<pair<int, int>, int> mp;   pair<int, int> a[maxn], b[maxn];   int n;   int main() {     scanf( %d , &n);     for (int i = 1; i <= n; ++i) scanf( %d%d , &a[i].first, &a[i].second);     for (int i = 1; i <= n; ++i) scanf( %d%d , &b[i].first, &b[i].second);     if (n == 1) {       printf( %d %d n , a[1].first + b[1].first, a[1].second + b[1].second);       return 0;     }     for (int i = 1; i <= n; ++i) {       ++mp[{a[1].first + b[i].first, a[1].second + b[i].second}];     }     for (int i = 2; i <= n; ++i) {       for (int j = 1; j <= n; ++j) {         int x = a[i].first + b[j].first, y = a[i].second + b[j].second;         if (mp.find({x, y}) != mp.end()) ++mp[{x, y}];       }     }     for (auto it : mp) {       if (it.second == n) {         printf( %d %d n , it.first.first, it.first.second);         break;       }     }     return 0;   }   