#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream f("cmap.in");
ofstream g("cmap.out");

int n,i,j;
long long dmin,dd;
struct gigi
{
    int x,y;
} v[100002];
bool fct (gigi a,gigi b)
{
    if(a.x==b.x) return(a.y<b.y);
    else
        return(a.x<b.x);
}
inline long long dist(gigi a,gigi b)
{
    return ((long long)((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)));
}

int main()
{

    f>>n;
    for(i=1; i<=n; i++)
        f>>v[i].x>>v[i].y;


    sort(v+1,v+n+1,fct);
    dmin=(1LL<<62);
    for(i=n-1; i>=1; i--)
        for(j=i+1; j<=n; j++)
        {
            dd=dist(v[i],v[j]);
            if(dmin<dd) break;
            else dmin=dd;
        }
    g<<setprecision(6)<<fixed;
    g<<sqrt(dmin);
}