#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define rep(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define all(a) (a).begin(),(a).end()
#define EXIST(s,e) (find(all(s),(e))!=(s).end())
#define exist(s,e) (find(all(s),(e))!=(s).end())
#define FINDi(s,e) distance((s).begin(),find(all(s),(e)))
#define INF (1<<25)
#define ll long long
#define VS vector<string>
#define VI vector<int>
#define vi vector<int>
#define VI2 vector<vector<int>>
#define vi2 vector<vector<int>>
#define v2Resize(s,x,y) s.resize(x); REP(i,s.size()) s[i].resize(y);
#define v2Fill(s,v) REP(v2filliiiiiii,s.size()) fill(all(s[v2filliiiiiii]),v);

#define Pii pair<int,int>
#define P pair;

#define in1(x,m) REP(in1iiiiiiiiiiii,m){int tmpForIn1Macrofjaio; cin>>tmpForIn1Macrofjaio; x.push_back(tmpForIn1Macrofjaio);}
#define in2(v2,x,y) REP(in2iiiiiiiiiiiiii,x) REP(in2jjjjjjjjj,y) cin>>v2[in2iiiiiiiiiiiiii][in2jjjjjjjjj];

#define OUT2(v2) REP(out2iiiiiiiii,v2.size()){ REP(out2jjjjjjjjjjj,v2[out2iiiiiiiii].size()){ cout<<v2[out2iiiiiiiii][out2jjjjjjjjjjj] << " ";}cout<<endl;};
const int mod = 1000000007;
int dy4[] = {0, 0, 1, -1};
int dx4[] = {1, -1, 0, 0};
int dx8[] = {0,1,1,1,0,-1,-1,-1};
int dy8[] = {-1,-1,0,1,1,1,0,-1};

struct edge { int u, v; ll cost; };

struct UnionFind {
	vector<int> data;

	UnionFind(int size) : data(size, -1) {
	}

	bool unionSet(int x, int y) {
		x = root(x);
		y = root(y);
		if (x != y) {
			if (data[y] < data[x]) swap(x, y);
			data[x] += data[y];
			data[y] = x;
		}
		return x != y;
	}

	bool findSet(int x, int y) {
		return root(x) == root(y);
	}

	int root(int x) {
		return data[x] < 0 ? x : data[x] = root(data[x]);
	}

	int size(int x) {
		return -data[root(x)];
	}
};

bool comp(const edge& e1, const edge& e2) {
	return e1.cost < e2.cost;
}

int n;
ll x[1010], y[1010];
vector<edge> es;


bool kruskal(ll length) {
	UnionFind uf = UnionFind(n);
	for (int i = 0; i < es.size() && es[i].cost <= length * length; ++i) {
		uf.unionSet(es[i].u, es[i].v);
	}
	return uf.findSet(0, n - 1);
}


int main() {
	cin >> n;
	rep(i, n)cin >> x[i] >> y[i];
	rep(i,n)
	rep(j,n) {
		edge e;
		e.u = i;
		e.v = j;
		e.cost = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
		es.push_back(e);
	}
	sort(all(es), comp);
	ll left = 0, right = 1e10;
	while (right - left > 1) {
		ll mid = (left + right) / 2;
		if (kruskal(mid))right = mid;
		else left = mid;
	}
	ll ans = left;
	for (int i = 0; i < 11; ++i) {
		if (ans % 10 == 0) {
			if (kruskal(ans))break;
		}
		ans++;
	}
	cout << ans << endl;
}