#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<ll,ll>
pi a[2000100],b[2001000];
#define fi first
#define se second
pi operator - (const pi &a,const pi &b){
    return {a.fi-b.fi,a.se-b.se};
}
int n;
ll ans=1e18;
int s1,s2;
ll dis(pi a){return a.fi*a.fi+a.se*a.se;}
pi x[2010000],y[2010000];
void cdq(int l,int r){
    if(r-l<=3){
        for(int i=l;i<=r;i++)for(int j=i+1;j<=r;j++)
        ans=min(ans,dis(a[j]-a[i]));
        sort(a+l,a+r+1,[&](pi x,pi y){return x.se<y.se;});
        return;
    }
    int mi=(l+r)>>1;
    ll D=(long long)sqrt(ans);
    cdq(l,mi),cdq(mi+1,r);
    ll M=-1e18;
    for(int i=l;i<=mi;i++)M=max(M,a[i].fi);
    s1=s2=0;
    for(int i=l;i<=mi;i++)if(a[i].fi>=M-D)x[++s1]=a[i];
    for(int i=mi+1;i<=r;i++)if(a[i].fi<=M+D)y[++s2]=a[i];
    int pl=0,pr=0;
    for(int i=1;i<=s2;i++){
        while(pr<s1&&x[pr+1].fi<=y[i].fi+D)pr++;
        while(pl<s1&&x[pl+1].fi<y[i].fi-D)pl++;
        for(int j=pl+1;j<=pr;j++)
        ans=min(ans,dis(x[j]-y[i]));
    }
    int x=l,y=mi+1,e=l;
    while(x<=mi||y<=r){
        if(x<=mi&&(y>r||a[x].se<a[y].se))b[e]=a[x++];
        else b[e]=a[y++];
        e++;
    }
    for(int i=l;i<=r;i++)a[i]=b[i];
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    scanf("%lld%lld",&a[i].fi,&a[i].se);
    sort(a+1,a+n+1);cdq(1,n);
    printf("%.13lf",sqrt(ans));
    return 0;
}