#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
struct P
{long long x,y;};
P a[100001],b[100001],c[100001],d[100001];
int i,n;

int A(P a,P b)
{return a.x<b.x||(a.x==b.x&&a.y<b.y);}

long long B(P p,P q)
{return (p.x-q.x)*(p.x-q.x)+(p.y-q.y)*(p.y-q.y);}

long long D(int p,int q)
{int m=(p+q)/2,i,j,l,k;
long long r=1LL<<62;
if(q-p<=1)
       return r;
if(q-p==2)
       return B(a[p],a[p+1]);
if(q-p==3)
       return min(B(a[p],a[p+2]),min(B(a[p],a[p+1]),B(a[p+1],a[p+2])));
r=min(D(p,m),D(m,q));
for(k=i=p,j=m+1;i<=m||j<=q;)
if(c[i].x<c[j].x)
       d[k++]=c[i++];
else
       d[k++]=c[j++];
for(j=0,i=p;i<=q;i++)
if(abs(d[i].y-a[m].x)<=r)
       b[++j]=d[i];
for(l=1;l<j;l++)
for(k=l+1;k<=j&&k-l<8;k++)
       r=min(r,B(b[l],b[k]));
return r;}

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