#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#define x first
#define y second

using namespace std;

ifstream f("cmap.in");
ofstream g("cmap.out");
const int MAXN = 100002;

pair <int, int> a[MAXN],b[MAXN], aux[MAXN];

long long distance( pair <int, int> A, pair <int, int> B ) {
	return 1LL * (A.x-B.x) * (A.x-B.x) + 1LL * (A.y-B.y) * (A.y-B.y);
}

long long get ( int begin, int end ) {
	if (begin == end) 
		return LLONG_MAX;
	if (end - begin == 1) {
		if (b[end] < b[begin]) 
			swap(b[end], b[begin]);
		return distance(b[begin], b[end]);
	}
	
	int middle = (begin+end)>>2;
	long long minDistance = min(get(begin, middle), get(middle+1, end));
	
	merge(b + begin, b + middle + 1, b + middle + 1, b + end + 1, aux);
	copy(aux, aux + (end - begin + 1), b + begin);
	
	int k = 0;
	for(int i=begin; i<=end; ++i)
		if (abs(b[i].y - a[middle].x) <= minDistance) 
			aux[k++] = b[i];
	
	for(int i=0; i<k; ++i)
		for(int j=i+1; j<k && j <= i + 8; ++j)
			minDistance = min(minDistance, distance(aux[i], aux[j]));
		

	return minDistance;
}

int main()
{
	int i, n;
	f>>n;
	for (i=1; i<=n; ++i)
		f >> a[i].x >> a[i].y;
	sort(a + 1, a + n + 1);
	for (i=1; i<=n; ++i)
		b[i] = make_pair(a[i].y, a[i].x);
	
	g.precision(6);
	g << sqrt( get(1, n) ) << "\n";	
	return 0;
}