#include <bits/stdc++.h>

using namespace std;

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

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

unsigned long long cmap (const vector< pair<int, int> >& points, int left, int right)
{
    if (number_of_points (left, right) <= 3 || (points[left].first == points[right].first))
    {
        unsigned long long mini = numeric_limits<unsigned 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 midIdx_start = (right+left)/2;
    int midIdx = midIdx_start;
    while(midIdx < right && points[midIdx_start].first == points[midIdx].first) midIdx++;
    midIdx--;
   // cout<<midIdx<<endl;
    unsigned long long mini = min(cmap(points,left,midIdx),cmap(points,midIdx+1,right));
    int i,j;
    i=midIdx;
    j=midIdx+1;

    assert(i>=left);
    assert(j<=right);
    int prev_x = points[i].first;
    int succ_x = points[j].first;

    while(points[i].first == prev_x && i >= left) i--;
    i++;
    while(points[j].first == succ_x && j <= right) j++;
    j--;

    if (i>j) {
        //cout << i << " " << j << endl;
        //cout << " === " << points[i].first << " " << points[j].first << endl;
    }
    if(i<j) {
        //cout << i << " " << j << endl;
        //cout << " --- " << points[i].first << " " << points[j].first << endl;
        for(int k = i; k<=midIdx;++k){
            for(int l = midIdx + 1; l <= j;++l){
                mini = min(mini,distanta(points[l],points[k]));
                //cout<<"k "<<k<<' '<<"l "<<l<<endl;
            }
        }
        //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;
}