#include<cmath>
#include<fstream>
#include<iomanip>
#include<algorithm>
using namespace std;
ifstream f("cmap.in");
ofstream g("cmap.out");
struct pct
{
    double x,y;
}a[100001];
int i,j,n;
double nr,min1;
bool cmp(pct a,pct b)
{
    if(a.x<b.x)
      return 1;
    return 0;
}
double dist(pct a, pct b)
{
    return (double)sqrt((b.x-a.x)*(b.x-a.x)+(b.y-a.y)*(b.y-a.y));
}
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
      f>>a[i].x>>a[i].y;
    sort(a+1,a+n+1,cmp);
    min1=dist(a[1],a[2]);
    for(i=3;i<=n;i++)
    {
        j=i-1;
        while(a[i].x-a[j].x<min1&&j>=1)
        {
            nr=dist(a[i],a[j]);
            if(min1>nr)
              min1=nr;
            j--;
        }
    }
    g<<fixed<<setprecision(6)<<min1;
    return 0;
}