#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 10;

ifstream f("cmap.in");
ofstream g("cmap.out");

pair< int, int > v[MAXN];

double dist(pair< int, int >& a, pair< int, int >& b){
    double dx = 1.0*(a.first-b.first);
    double dy = 1.0*(a.second-b.second);
    return sqrt(dx*dx + dy*dy);
}
int main(){
    int n;
    f >> n;
    for(int i = 0; i < n; ++i){
        f >> v[i].first >> v[i].second;
    }

    sort(v, v + n);
    double best = dist(v[0], v[1]);

    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n && v[j].first - v[i].first < best; ++j){
            best = min(best, dist(v[i], v[j]));
        }
    }

    g << setprecision(10) << fixed << best;
    return 0;
}