func_code_string: #include <bits/stdc++.h>   using namespace std;   const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};   const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};   const int Mod = 1000000000 + 0;   template <typename T>   inline T sq(T x) {     return x * x;   }   template <typename T>   inline T In() {     T x;     cin >> x;     return x;   }   template <typename T>   inline void Out(T& x) {     cout << x;   }   template <typename T>   inline void sort(T& v) {     sort(begin(v), end(v));   }   template <typename T>   inline void revs(T& v) {     reverse(begin(v), end(v));   }   template <typename T>   inline void uniq(T& v) {     sort(v);     v.erase(unique(begin(v), end(v)), end(v));   }   template <typename T>   inline int ubnd(T& v, typename T::value_type& x) {     return upper_bound(begin(v), end(v), x) - begin(v);   }   template <typename T>   inline int lbnd(T& v, typename T::value_type& x) {     return lower_bound(begin(v), end(v), x) - begin(v);   }   template <typename T, typename F>   inline void inpt(T& v, int n, F f) {     for (v.reserve(n); n--; v.emplace_back(f()))       ;   }   template <typename T, typename F>   inline void show(T& v, F f, string d =    , string e =   n ) {     int i = 0;     for (auto& x : v) i++ && (cout << d), f(x);     cout << e;   }   template <typename T>   inline typename T::iterator minel(T& v) {     return min_element(begin(v), end(v));   }   template <typename T>   inline typename T::iterator maxel(T& v) {     return max_element(begin(v), end(v));   }   inline void fast_io() {     ios::sync_with_stdio(0);     cin.tie(0);   }   inline int in() {     int x;     scanf( %d , &x);     return x;   }   inline long long pow_mod(long long a, long long k, long long m) {     long long r = 1;     for (; k > 0; a = a * a % m, k >>= 1)       if (k & 1) r = r * a % m;     return r;   }   inline long long mod_inv(long long a, long long p) {     return pow_mod(a, p - 2, p);   }   int main() {     vector<long long> xs, ys;     int n = in();     for (int i = 0; i < n; i++) {       long long x, y;       cin >> x >> y;       xs.emplace_back(x);       ys.emplace_back(y);     }     sort(xs);     sort(ys);     long long xx = abs(xs[0] - xs[n - 1]);     long long yy = abs(ys[0] - ys[n - 1]);     cout << sq(max(xx, yy)) << endl;     return 0;   }   