#include<stdio.h>
#include<math.h>
#define N 100001
#define M 1000000
typedef struct point
{double x,y;};
point a[N],b[N];
long i,n;

double min(double p,double q)
{if(p<q)
       return p;
return q;}

void sort(point a[N],long l,long r)
{long m=(l+r)>>1,i,j,k,t;
if(l==r)
      return;
sort(a,l,m);
sort(a,m+1,r);
for(i=l,j=m+1,k=l;i<=m||j<=r;)
if(j>r||(i<=m&&(a[i].x<a[j].x||(a[i].x==a[j].x&&a[i].y<a[j].y))))
      b[k++]=a[i++];
else
      b[k++]=a[j++];
for(t=l;t<=r;t++)
      a[t]=b[t];}
      
double dist(point p,point q)
{return M*sqrt(((p.x-q.x)/M)*((p.x-q.x)/M)+((p.y-q.y)/M)*((p.y-q.y)/M));}

double cauta(long z[N],long p,long q,double dmin)
{long m=(p+q)>>1,i,j;
double d;
if(q-p<=3)
      {for(i=p;i<q;i++)
             {for(j=i+1;j<=q;j++)
                    {d=dist(a[z[i]],a[z[j]]);
                    if(d<dmin)
                            dmin=d;}}
      return dmin;}
return min(cauta(z,p,m,dmin),cauta(z,m+1,q,dmin));}

double combina(long p,long m,long q,double r)
{long i=m+1,j=m-1,k=0,z[N],t;
double d;
while(a[i].x-a[m].x<r&&i<=q)
      z[++k]=i++;
t=k;
while(a[m].x-a[j].x<r&&j>=p)
      z[++k]=j--;             
r=cauta(z,1,k,r);
for(i=t;i>=1;i--)
      {for(j=t+1;j<=k;j++)
      if(a[z[i]].x-a[z[j]].x<r)
              {if((d=dist(a[z[i]],a[z[j]]))<r)
                     r=d;}
      else
              break;}
return r;}

double close(point a[N],long p,long q)
{long m=(p+q)>>1,i,j;
double d,ird;
if(q-p<=3)
      {ird=dist(a[p],a[p+1]);
      for(i=p;i<q;i++)
            {for(j=i+1;j<=q;j++)
                   {d=dist(a[i],a[j]);
                   if(d<ird)
                          ird=d;}}
      return ird;}
return combina(p,m,q,min(close(a,p,m),close(a,m+1,q)));}

int main()
{freopen("cmap.in","r",stdin);
freopen("cmap.out","w",stdout);
scanf("%ld\n",&n);
for(i=1;i<=n;i++)
      scanf("%lf%lf\n",&a[i].x,&a[i].y);
sort(a,1,n);
printf("%.6lf\n",close(a,1,n));
fclose(stdin);
fclose(stdout);
return 0;}