1
#include<bits/stdc++.h>
2
#define PII pair<long long, long long>
3
using namespace std;
4
#define x first
5
#define y second
6
const int N = 4e5 + 10;
7
PII p[N];
8
int n;
9
#define ll long long
10
long long merge(int l, int r)
11
{
12
//  cout << l << " " << r << "----------\n";
13
  if(l == r) return 0x3f3f3f3f3f3f3f3f;
14
  int mid = (l + r) >> 1;
15
  ll h1 = merge(l, mid);
16
  ll h2 = merge(mid + 1, r);
17
  ll h = min(h1, h2);
18
  vector <PII> B;
19
  for(int i = l;i <= r;i++)
20
  {
21
    if((p[i].x - p[mid].x) * (p[i].x - p[mid].x) < h) B.push_back({p[i].y, p[i].x});
22
  }
23
  sort(B.begin(), B.end());
24
//  for(auto i : B)
25
//  {
26
//    cout << i.x << " " << i.y << endl;
27
//  }
28
  for(int i = 0;i < B.size();i++)
29
  {
30
    for(int q = i + 1;q < B.size();q++)
31
    {
32
      if((B[i].first - B[q].first) * (B[i].first - B[q].first) > h) break;
33
      h = min(h, (B[i].first - B[q].first) * (B[i].first - B[q].first) + (B[i].second - B[q].second) * (B[i].second - B[q].second));
34
    }
35
  }
36
//  cout << l << " " << r << "  " << h << endl;
37
  return h;
38
}
39

40
int main()
41
{
42
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
43
  cin >> n;
44
  for(int i = 1;i <= n;i++)
45
    cin >> p[i].x >> p[i].y;
46

47
  sort(p + 1, p + 1 + n);
48

49
  cout << merge(1, n) << endl;
50
  return 0;
51
}