#include<fstream>
#include<algorithm>
#include<cmath>
using namespace std;

ifstream fin("cmap.in");
ofstream fout("cmap.out");
const int inf=(1<<30);
const int nmax=100005;
long n,i;

struct Point {
    long x,y;
}v[nmax];

bool cond(Point i,Point j) {
    return i.x<j.x;
}
double dist(long i,long j) {
    return sqrt(pow(v[i].x-v[j].x,double(2))+pow(v[i].y-v[j].y,double(2)));
}
double rezolva(long d,double rez) {
    long i,j;
    double p;
    for(i=1; i<=n; ++i)
    for(j=i+1; j<=i+7 && j<=n; ++j) {
        p=dist(i,j);
        if(p<rez) rez=p;
    }
    return rez;
}
int main()
{
    fin>>n;
    for(i=1; i<=n; ++i)
        fin>>v[i].x>>v[i].y;
    sort(v+1,v+n+1,cond);
    fout<<rezolva(v[n/2].x,inf);
    return 0;
}