#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline))
#define U(i,l,r) for(int i=l,END##i=r; i<=END##i; ++i)
#define D(i,l,r) for(int i=l,END##i=r; i>=END##i; --i)
using namespace std;
using ll = __int128;
const ll INF = ll(0x3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f);

#define GC c=getchar()
#define IC isdigit(c)
void rd(auto &s) { s = 0; char GC;
	for (; !IC; GC);
	for (; IC; GC) s = s * 10 + c - 48;
} void rd(auto &s, auto &...t) { rd(s); rd(t...); }

const int N = 2000006;
struct Pt { ll x, y; } pt[N];
bool operator < (const Pt &l, const Pt &r) {
	return l.x == r.x ? l.y < r.y : l.x < r.x; }
bool cmp(const Pt &l, const Pt &r) { return l.y < r.y; }
ll Q(ll x) { return x * x; }

int n;
ll solve(int l, int r) {
	if (l == r) return INF;
	int mid((l + r) >> 1);
	ll mX = pt[mid].x;
	ll d = min(solve(l, mid), solve(mid + 1, r));
	inplace_merge(pt + l, pt + mid + 1, pt + r + 1, cmp);
	
	int p = l, q = l;
	U (i, l, r) {
		while (q < r && Q(pt[q + 1].y - pt[i].y) <= d)
			++q;
		while (p < q && Q(pt[i].y - pt[p].y) > d)
			++p;
		if (Q(pt[i].x - mX) > d) continue;
		U (j, p, q) if (i != j)
			d = min(d, Q(pt[i].x - pt[j].x) + Q(pt[i].y - pt[j].y));
	}
	return d;
}

int main() {
	rd(n);
	U (i, 1, n) rd(pt[i].x, pt[i].y);
	
	sort(pt + 1, pt + n + 1);
	ll ans = solve(1, n);
	printf("%.8lf", sqrt((long double)(ans)));
}