#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
#define min(a, b) (a < b ? a : b) 
using namespace std;

struct point{int x, y;};

int d(point a, point b){
	return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y); 
}

bool Compare(point a, point b){
	if (a.x == b.x) return a.y < b.y;
	return a.x < b.x;
}

vector <point> v;

int Dist(int l, int r){
	if (r - l == 1) return d(v[l], v[r]);
	int i, j, q, dL, dR, m = (l + r) / 2;
	dL = Dist(l, m);
	dR = Dist(m, r);
	q = min (dL, dR);
	
	for (i = 0; i < v.size(); i++)
		for (j = i + 1; j < i + 8 && j < v.size(); j++)
			q = min (d(v[i], v[j]), q);
	return q;
}

int main(){
	freopen("cmap.in", "r", stdin), freopen("cmap.out", "w", stdout);
	int n, i, x, y;
	scanf("%d", &n);
	
	for (i = 0; i < n; i++)
		scanf("%d %d", &x, &y),
		v.push_back((point) {x, y});
		
	sort(v.begin(), v.end(), Compare);
	x = Dist(0, n - 1);
	printf("%lf", sqrt(x));
}