#include<iostream>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 int n;

 struct node

 {

   double x;

   double y;

 }p[];

 int a[];

 double cmpx(node a,node b)

 {

   return a.x<b.x;

 }

 double cmpy(int a,int b)

 {

   return p[a].y<p[b].y;

 }

 double min(double a,double b)

 {

   return a<b?a:b;

 }

 double dis(node a,node b)

 {

   return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));

 }

 double find(int l,int r)

 {

      if(r==l+)

       return dis(p[l],p[r]);

      if(l+==r)

       return min(dis(p[l],p[r]),min(dis(p[l],p[l+]),dis(p[l+],p[r])));

      int mid=(l+r)>>;

      double ans=min(find(l,mid),find(mid+,r));

      int i,j,cnt=;

      for(i=l;i<=r;i++)

      {

        if(p[i].x>=p[mid].x-ans&&p[i].x<=p[mid].x+ans)

           a[cnt++]=i;

      }

      sort(a,a+cnt,cmpy);

      for(i=;i<cnt;i++)

      {

        for(j=i+;j<cnt;j++)

        {

          if(p[a[j]].y-p[a[i]].y>=ans) break;

          ans=min(ans,dis(p[a[i]],p[a[j]]));

        }

      }

      return ans;

 }

 int main()

 {

     int i;

     while(scanf("%d",&n)!=EOF)

     {

       if(!n) break;

       for(i=;i<n;i++)

        scanf("%lf %lf",&p[i].x,&p[i].y);

       sort(p,p+n,cmpx);

       printf("%.2lf%\n",find(,n-)/);

     }

     return ;

 }

  #include<stdio.h>

 int main()

 {

     int n;

     int start,a;

     int t;

     int i;

     while(scanf("%d",&n),n)

     {

         t=;start=;

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

         {

             scanf("%d",&a);

             if(a>start)t+=*(a-start);

             else t+=*(start-a);

             t+=;

             start=a;

         }

         printf("%d\n",t);

     }

     return ;

 }

 #include<iostream>

 #include<string.h>

 #include<stdio.h>

 #include<ctype.h>

 #include<algorithm>

 #include<stack>

 #include<queue>

 #include<set>

 #include<math.h>

 #include<vector>

 #include<map>

 #include<deque>

 #include<list>

 using namespace std;

 typedef struct node{

     int j;

     int f;

     double d;

 }MC;

 MC a[];

 bool cmp(MC a,MC b)

 {

     return a.d>b.d;

 }

 int main()

 {

     int n,m,i;

     double t;

     while(cin>>n>>m)

     {

         if(n==-&&m==-)

             break;

         for(int i=;i<m;i++)

         {

             cin>>a[i].j>>a[i].f;

             a[i].d=1.0*a[i].j/a[i].f;

         }

         sort(a,a+m,cmp);

         t=;

         for(int i=;i<m;i++)

         {

             if(n>a[i].f)

             {

                 t+=a[i].j;

                 n-=a[i].f;

             }

             else

             {

                 t+=n*a[i].d;break;

             }

         }

         printf("%.3lf\n",t);

     }

     return ;

 }

 #include<iostream>

 #include<string.h>

 #include<stdio.h>

 #include<ctype.h>

 #include<algorithm>

 #include<stack>

 #include<queue>

 #include<set>

 #include<math.h>

 #include<vector>

 #include<map>

 #include<deque>

 #include<list>

 using namespace std;

 int a[]={,};

 int main()

 {

     for(int i=;i<=;i++)

     {

         if(a[i]==)

         {

             for(int j=i;j<=;j+=i)

                 a[j]=i;

         }

     }

     int n;

     while(scanf("%d",&n)!=EOF)

     {

         int ans;

         int maxn=;

         while(n--)

         {

             int m;

             scanf("%d",&m);

             if(a[m]>maxn)

             {

                 ans=m;

                 maxn=a[m];

             }

         }

         printf("%d\n",ans);

     }

     return ;

 }