// compile: make data
// run: time ./data < data.in
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x),__VA_ARGS__})
#define cmax(x,...) x=max({(x),__VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010
 
 
int32_t main() {
    // ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
 
    // int n; cin >> n;
    int n; scanf("%lld", &n);
    vector<pair<int, int>> a(n);
    // rep(i, 0, n) cin >> a[i].first >> a[i].second;
    int minx = INTMAX, maxx = -INTMAX, miny = INTMAX, maxy = -INTMAX;
    rep(i, 0, n) {
        scanf("%lld%lld", &a[i].first, &a[i].second);
        cmin(minx, a[i].first);
        cmax(maxx, a[i].first);
        cmin(miny, a[i].second);
        cmax(maxy, a[i].second);
    }
    rep(i, 0, n) a[i].first -= minx, a[i].second -= miny;
    maxx -= minx, maxy -= miny;
    // mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    // shuffle(a.begin(), a.end(), rng);
 
    auto dist = [&](int i, int j) {
        return (a[i].first-a[j].first) * (a[i].first-a[j].first) + (a[i].second-a[j].second) * (a[i].second-a[j].second);
    };
    int minv = dist(0, 1);
    int S = ceil(sqrt(minv));
    if (maxx * maxy > 1e7) {
        map<pair<int, int>, vector<int>> m;
        auto build = [&](int des) -> void {
            m.clear();
            rep(i, 0, des) m[{a[i].first/S, a[i].second/S}].emplace_back(i);
        };
        int idx = n & 1;
        rep(i, 0, sz(a)) {
            if (idx != i) cmin(minv, dist(idx, i));
        }
        rep(i, 0, n) {
            int cur = minv;
            for (int x = a[i].first/S-1; x <= a[i].first/S; ++x) {
                for (int y = a[i].second/S-1; y <= a[i].second/S+1; ++y) {
                    for (auto id: m[{x, y}]) {
                        cmin(cur, dist(i, id));
                    }
                }
            }
            if (cur >= minv) {
                m[{a[i].first/S, a[i].second/S}].emplace_back(i);
                continue;
            }
            minv = cur;
            S = ceil(sqrt(minv));
            build(i+1);
        }
        printf("%lld\n", minv);
    }
    else {
        vector<vector<vector<int>>> m(maxx+1, vector<vector<int>>(maxy+1, vector<int>()));
        auto build = [&](int des) -> void {
            rep(i, 0, des) m[a[i].first/S][a[i].second/S].clear();
            rep(i, 0, des) m[a[i].first/S][a[i].second/S].emplace_back(i);
        };
        build(2);
        rep(i, 2, n) {
            int cur = minv;
            for (int x = a[i].first/S-1; x <= a[i].first/S+1; ++x) {
                for (int y = a[i].second/S-1; y <= a[i].second/S+1; ++y) {
                    if (x < 0 || y < 0 || x > maxx || y > maxy) continue;
                    for (auto id: m[x][y]) cmin(cur, dist(i, id));
                }
            }
            if (cur >= minv) {
                m[a[i].first/S][a[i].second/S].emplace_back(i);
                continue;
            }
            minv = cur;
            S = ceil(sqrt(minv));
            build(i+1);
        }
        printf("%lld\n", minv);
    }
 
    return 0;
}