#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <iomanip>
#include <math.h>
#define i64 unsigned long long
using namespace std;

class punct{
public:
    i64 x;
    i64 y;

    bool operator <(const punct p2) const
    {
        return x < p2.x;
    }
};

i64 compareY(const punct a, const punct b)
{
    return (a.y < b.y);
}

punct v[100005], X[100005], Y[100005];
int N;
i64 last;
i64 pldist(punct p1, punct p2)
{
    return /*sqrt*/( (p1.x - p2.x)*(p1.x - p2.x) +
                 (p1.y - p2.y)*(p1.y - p2.y)  );
}

i64 brutu(punct p[], int n)
{
    i64 minim = 4e18;
    for (int i = 0; i < n; ++i)
        for (int j = i+1; j < n; ++j)
            if (pldist(p[i], p[j]) < minim)
                minim = pldist(p[i], p[j]);
    return minim;
}
i64 minfasie(punct fasie[], int sz, i64 dist)
{
    i64 minim = dist;
   // sort(fasie, fasie+sz, compareY);
    for (int i = 0; i < sz; ++i)
        for (int j = i+1; j < sz && (fasie[j].y - fasie[i].y) < minim; ++j)
            if (pldist(fasie[i],fasie[j]) < minim)
                minim = pldist(fasie[i], fasie[j]);
    return minim;
}
i64 div_and_q(punct x[], punct y[], int n)
{
    if(n<4)
        return brutu(x, n);
    int mid = n/2;
    punct mijloc = x[mid]; //puncte prin care ducem o || la Oy
    punct yl[mid+1];   // y stanga
    punct yr[n-mid-1];  // y dreapta
    int li=0, ri=0;
    for (int i = 0; i < n; i++)
    {
      if (y[i].x <= mijloc.x)
      {
         yl[li] = y[i];
         ++li;
      }
      else
      {
         yr[ri] = y[i];
         ++ri;
      }
    }
    i64 dl = div_and_q(x, yl, mid);
    i64 dr = div_and_q(x + mid, yr, n-mid);
    i64 dist = min(dl, dr);
    //cout<<dist<<"\n";
    punct fasie [n];
    int j = 0;
    for (int i = 0; i < n; ++i)
        if (abs(y[i].x - mijloc.x) < dist)
        {
            fasie[j] = y[i];
            ++j;
        }
    return min(dist, minfasie(fasie, j, dist));
}

int main()
{

    ifstream in ("cmap.in");
    ofstream out ("cmap.out");
    int i;
    in>>N;
    for(i=0;i<N;++i)
    {
        in>>v[i].x>>v[i].y;
        X[i]=v[i];
        Y[i]=v[i];
    }
    sort(X, X+N);
    sort(Y, Y+N, compareY);
    out<<fixed<<setprecision(6)<<sqrt(div_and_q(X, Y, N));
    in.close();
    out.close();
    return 0;
}