#include <bits/stdc++.h>

using namespace std;

long long distanta (const pair<int, int>& point_a, const pair<int, int>& point_b) {
    return  ( (point_a.first - point_b.first) * (point_a.first - point_b.first)
                  + (point_a.second - point_b.second) * (point_a.second - point_b.second));
}

int number_of_points (int left, int right) {
    return left - right;
}

long long cmap (const vector< pair<int, int> >& points, int left, int right) {
    if (number_of_points (left, right) <= 3) {
        long long mini = numeric_limits<long long>::max();
        for (int i = left; i < right; i++) {
            for (int j = i + 1; j <= right; j++) {
                mini = min (mini, distanta (points[i], points[j]));
            }
        }
        return mini;
    }
    int mid = (right+left)/2;
    int i,j;
    i=j=mid;
    long long mini = min(cmap(points,left,mid),cmap(points,mid+1,right));
    while(distanta(points[i--],points[mid]) < mini);
    while(distanta(points[j++],points[mid]) < mini);
    mini = min(cmap(points,i,j),mini);
    return mini;
}

int main() {
    int n;
    ifstream in("cmap.in");
    ofstream out("cmap.out");
    in.tie(NULL);
    ios::sync_with_stdio(false);
    in >> n;
    vector< pair<int, int> > points (n);
    for (int i = 0; i < n; i++) {
        in >> points[i].first >> points[i].second;
    }
    sort (begin (points), end (points));
    out <<fixed<<setprecision(6) <<sqrt(cmap (points, 0, n - 1));
    return 0;
}