#include <stdio.h>
#include <stdlib.h>
#include <math.h>
typedef struct
{
    int id;
    float x,y;
} punct;
float dmin;
int id_p1,id_p2;
void citire(int *n,punct **p)
{
    FILE *f=fopen("cmap.in","r");
    fscanf(f,"%d",n);
    *p=(punct*)malloc((*n)*sizeof(punct));
    for(int i=0; i<*n; i++)
    {
        fscanf(f,"%f%f",&(*p)[i].x,&(*p)[i].y);
        (*p)[i].id=i+1;
    }
    fclose(f);
}
int cmp(const void *a, const void *b)
{
    punct pa = *(punct*)a;
    punct pb = *(punct*)b;
    if(pa.x < pb.x) return -1;
    if(pa.x > pb.x) return  1;
    return 0;
}
float dist(punct a,punct b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
void div_et_imp(punct *p,int st,int dr)
{
    if(st<dr)
    {
        if(dr-st==1) //problema direct rezolvabila: o multime cu doar 2 puncte
        {
            float d=dist(p[st],p[dr]);
            if(dmin>d)
            {
                dmin=d;
                id_p1=p[st].id;
                id_p2=p[dr].id;
            }
        }
        else
        {
            int mij=(st+dr)/2;
            div_et_imp(p,st,mij);
            div_et_imp(p,mij+1,dr);
        }
    }


}
int main()
{
    punct *p;
    int n;
    citire(&n,&p);
    qsort(p, n, sizeof(punct), cmp); //sortam datele in functie de abscisa
    dmin=dist(p[0],p[1]); //initializam minimul cu distanta dintre primele 2 puncte
    id_p1=p[0].id;//initializam cu primele 2 puncte pentru a rezolva direct si cazul in care n=2
    id_p2=p[1].id;
    div_et_imp(p,0,n-1);
    FILE *g=fopen("cmap.out","w");
    fprintf(g,"%f",dmin);
    fclose(g);
    free(p);
    return 0;
}