#include<cmath>

 #include<cstdio>

 #include<cctype>

 #include<algorithm>

 inline int getint() {

     register char ch;

     while(!isdigit(ch=getchar()));

     register int x=ch^'';

     while(isdigit(ch=getchar())) x=(((x<<)+x)<<)+(ch^'');

     return x;

 }

 typedef std::pair<double,double> Point;

 const int N=;

 Point p[N];

 int num[N];

 double ans=1e10;

 inline double sqr(const double &x) {

     return x*x;

 }

 inline double dis(const Point &a,const Point &b) {

     return sqrt(sqr(std::abs(a.first-b.first))+sqr(std::abs(a.second-b.second)));

 }

 void solve(const int &l,const int &r) {

     if(l==r) return;

     const int mid=(l+r)/;

     solve(l,mid);`

     solve(mid+,r);

     num[]=;

     for(register int i=mid+;i<=r;i++) {

         if(p[i].first-p[mid].first<ans) {

             num[++num[]]=i;

         }

     }

     for(register int i=l;i<=mid;i++) {

         if(p[mid].first-p[i].first<ans) {

             for(register int j=;j<=num[];j++) {

                 ans=std::min(ans,dis(p[i],p[num[j]]));

             }

         }

     }

 }

 int main() {

     const int n=getint();

     for(register int i=;i<n;i++) {

         scanf("%lf%lf",&p[i].first,&p[i].second);

     }

     std::sort(&p[],&p[n]);

     solve(,n-);

     printf("%.4f\n",ans);

     return ;

 }