#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, x[1000], y[1000];
vector<pair<LL, pair<int, int>>> v;

const int N = 1000;
vector<int> ar[N];
int id[N];
void init() {
	inc(i, n) { ar[i].PB(i); id[i] = i; }
}
void unite(int x, int y) {
	x = id[x], y = id[y];
	if(x == y) { return; }
	if(ar[x].size() > ar[y].size()) { swap(x, y); }
	
	dec(i, ar[x].size()) {
		id[ ar[x][i] ] = y;
		ar[y].PB(ar[x][i]);
		ar[x].pop_back();
	}
}

int main() {
	cin >> n;
	inc(i, n) { cin >> x[i] >> y[i]; }
	
	inc(i, n) {
	inc(j, i) {
		LL xx = (x[i] - x[j]) * (x[i] - x[j]);
		LL yy = (y[i] - y[j]) * (y[i] - y[j]);
		v.EB(xx + yy, MP(i, j));
	}
	}
	
	init();
	sort(ALL(v));
	LL ans = -1;
	inc(i, v.size()) {
		unite(v[i].SE.FI, v[i].SE.SE);
		if(id[0] == id[n - 1]) {
			ans = v[i].FI;
			break;
		}
	}
	
	LL L = 0, H = 2e8;
	while(H - L > 1) {
		LL M = (H + L) / 2;
		(M * M * 100 < ans ? L : H) = M;
	}
	
	cout << H * 10 << endl;
	
	return 0;
}