#include <fstream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
using namespace std;
ifstream cin("cmap.in");
ofstream cout("cmap.out");
#pragma GCC optimize ("Ofast")
// e infoarena deci probabil se ia 100 cu asta
int n;
struct point{int x,y;};
vector <point> p;
double formula(point unu, point doi)
{
    return sqrt((unu.x-doi.x)*(unu.x-doi.x)+(unu.y-doi.y)*(unu.y-doi.y));
}
int main()
{
    cin >> n;
    for(int i = 1 ; i <= n ; ++i)
    {
        int asta , ala;
        cin >> asta >> ala;
        p.push_back({asta,ala});
    }
    sort(p.begin(),p.end(),[](point unu,point doi){return unu.x<doi.x;});
    double dist = formula(p[0],p[1]);
    for(int i = 2 ; i < (int)p.size() ; ++i)
    {
        for(int j = i-1 ; j >= 1 ; --j)
        {
            int d = (int)dist;
            if(p[i].x-p[j].x > d) break;
            dist = min(dist,formula(p[i],p[j]));
        }
    }
    cout << fixed << setprecision(6) << dist ;
    return 0;
}