/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define db double
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 666013
#define DIM 60010000
#define base 256
#define bas 255
#define N 1000100
#define inf 0x3f3f3f3f
#define pdd pair<double,double>
using namespace std;
ifstream f("cmap.in");
ofstream g("cmap.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
int n;
pdd v[N],aux[N],aux2[N];
double dist(pdd a,pdd b)
{
    return (a.fi-b.fi)*(a.fi-b.fi)+(a.se-b.se)*(a.se-b.se);
}
double solve(int x,int y)
{
    if(x==y)
        return (1LL<<60);
    if(y-x==1)
    {
        if(v[x].se>v[y].se)
            swap(v[x],v[y]);
        return dist(v[x],v[y]);
    }
    int mij=(x+y)>>1;
    double mid=v[mij].fi;
    double sol=min(solve(x,mij),solve(mij+1,y));
    int p1=x;
    int p2=mij+1;
    int t=0;
    int tb=0;
    for(;p1<=mij&&p2<=y;)
    {
        if(v[p1].se<=v[p2].se)
        {
            if(mid-v[p1].fi<sol)
                aux[++t]=v[p1];
            aux2[++tb]=v[p1++];
        }
        else
        {
            if(mid-v[p2].fi<sol)
                aux[++t]=v[p2];
            aux2[++tb]=v[p2++];
        }
    }
    for(;p1<=mij;++p1)
    {
        if(mid-v[p1].fi<sol)
            aux[++t]=v[p1];
        aux2[++tb]=v[p1];
    }
    for(;p2<=y;++p2)
    {
        if(mid-v[p2].fi<sol)
            aux[++t]=v[p2];
        aux2[++tb]=v[p2];
    }
    FOR(i,1,t)
    {
        int k=min(t,i+10);
        FOR(j,i+1,k)
        sol=min(sol,dist(aux[i],aux[j]));
    }
    t=0;
    FOR(i,x,y)
    v[i]=aux2[++t];

    return sol;
}
int main ()
{
    f>>n;
    FOR(i,1,n)
    f>>v[i].fi>>v[i].se;
    sort(v+1,v+n+1);
    g<<fixed<<setprecision(10)<<sqrt(solve(1,n));
    return 0;
}