#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define ll2(x, y) ll x, y; cin >> x >> y;
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

bool is[5001][5001] = {false};
i_i h[3000];

int area(i_i a, i_i b){
  int res = (b.X - a.X) * (b.X - a.X) + (b.Y - a.Y) * (b.Y - a.Y);
  return res;
}

bool ok(int q, int i, int j){
  if(q == 0){
    if(0 > h[i].X - (h[j].Y - h[i].Y) || h[i].X - (h[j].Y - h[i].Y) > 5000)return false;
    if(0 > h[i].Y + (h[j].X - h[i].X) || h[i].Y + (h[j].X - h[i].X) > 5000)return false;
    if(0 > h[j].X - (h[j].Y - h[i].Y) || h[j].X - (h[j].Y - h[i].Y) > 5000)return false;
    if(0 > h[j].Y + (h[j].X - h[i].X) || h[j].Y + (h[j].X - h[i].X) > 5000)return false;
  }else{
    if(0 > h[i].X + (h[j].Y - h[i].Y) || h[i].X + (h[j].Y - h[i].Y) > 5000)return false;
    if(0 > h[i].Y - (h[j].X - h[i].X) || h[i].Y - (h[j].X - h[i].X) > 5000)return false;
    if(0 > h[j].X + (h[j].Y - h[i].Y) || h[j].X + (h[j].Y - h[i].Y) > 5000)return false;
    if(0 > h[j].Y - (h[j].X - h[i].X) || h[j].Y - (h[j].X - h[i].X) > 5000)return false;
  }
  return true;
}
signed main(void){
  int i, j;
  for(int testcase = 0;testcase >= 0;testcase++){
    int(n);
    if(!n)break;
    rep(i, 5001)rep(j, 5001)is[i][j] = false;

    rep(i, n){
      scanf("%d %d", &h[i].X, &h[i].Y);
      is[h[i].X][h[i].Y] = true;
    }

    int res = 0;
    rep(i, n)rep(j, i){
      //if(testcase == 6)pri2(i, j);
      if(ok(0, i, j) &&
         is[h[i].X - (h[j].Y - h[i].Y)][h[i].Y + (h[j].X - h[i].X)]
      && is[h[j].X - (h[j].Y - h[i].Y)][h[j].Y + (h[j].X - h[i].X)])
      res = max(res, area(h[i], h[j]));
      if(ok(1, i, j) &&
         is[h[i].X + (h[j].Y - h[i].Y)][h[i].Y - (h[j].X - h[i].X)]
      && is[h[j].X + (h[j].Y - h[i].Y)][h[j].Y - (h[j].X - h[i].X)])
      res = max(res, area(h[i], h[j]));
    }

    pri(res);

//*/

//*/ break;
  }
  return 0;
}

Measured memory_bytes: 27580