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

using namespace std;

ifstream fin ("cmap.in");
ofstream fout ("cmap.out");

const int NM = 100100;

int n, i, j;
double d;

vector< pair<double, double> > v(NM);

double dist(int a, int b) {
    return sqrt( (v[a].x - v[b].x) * (v[a].x - v[b].x) + (v[a].y - v[b].y) * (v[a].y - v[b].y) );
}

int main() {
    fin >> n;
    for (i = 1; i <= n; ++i) {
        fin >> v[i].x >> v[i].y;
    }
    sort(v.begin() + 1, v.begin() + n + 1);
    d = dist(1, n);
    for (i = 1; i <= n; ++i) {
        for(j = i + 1; j <= n; ++j) {
            if (v[j].x - v[i].x > d) {
                break;
            }
            if (dist(i, j) < d) {
                d = dist(i, j);
            }
        }
    }
    fout << fixed << setprecision(6) << d;
    return 0;
}