#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
using namespace std;

const char iname[] = "cmap.in";
const char oname[] = "cmap.out";

typedef long long i64;

const int MAX_N = 100005;
const i64 INF = 4e18;

vector < pair <i64, i64> > V(MAX_N), X, Y;

i64 dist(const pair <i64, i64>& a, const pair <i64, i64>& b) {
	return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second);
}

i64 go(int st, int dr, vector < pair <i64, i64> >& X, vector < pair <i64, i64> >& Y) {
	if (st >= dr - 1)
		return INF;
	else if (dr - st == 2) {
		if (Y[st] > Y[st + 1])
			swap(Y[st], Y[st + 1]);
		return dist(X[st], X[st + 1]);
	}
	int mid = (st + dr) / 2;
	i64 best = min(go(st, mid, X, Y), go(mid, dr, X, Y));

	sort(Y.begin() + st, Y.begin() + dr);

	int v_size = 0;
	for (int i = st; i < dr; ++i) if (abs(Y[i].second - X[mid].first) <= best)
		V[v_size++] = Y[i];
	for (int i = 0; i < v_size - 1; ++i) {
		for (int j = i + 1; j < v_size && j - i < 8; ++j)
			best = min(best, dist(V[i], V[j]));
	}
	return best;
}

int main(void) {
	int n;
	ifstream in(iname);
	assert(in >> n);
	assert(1 <= n && n <= 100000);

	X.resize(n), Y.resize(n);
	for (int i = 0; i < (int)X.size(); ++i) {
		assert(in >> X[i].first >> X[i].second);
		assert(-1000000000 <= X[i].first && X[i].first <= +1000000000);
		assert(-1000000000 <= X[i].second && X[i].second <= +1000000000);
	}
	in.close();

	sort(X.begin(), X.end());
	for (int i = 0; i < (int)X.size(); ++i)
		Y[i] = make_pair(X[i].second, X[i].first);

	ofstream out(oname);
	out << fixed << setprecision(6) << sqrt(go(0, (int)X.size(), X, Y)) << "\n";
	out.close();
	return 0;
}