#include <bits/stdc++.h>
#define il inline
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int N=2e6+5,inf=2e9;const ll oo=4e18;
int n,B,cnt;pii a[N];ll ans;
il ll dis(pii x,pii y){return 1ll*(x.fi-y.fi)*(x.fi-y.fi)+1ll*(x.se-y.se)*(x.se-y.se);}
int dx[9]={0,0,1,1,1,0,-1,-1,-1};
int dy[9]={0,1,1,0,-1,-1,-1,0,1};
unordered_map<ll,int> mp;
vector<pii> e[N];
il ll id(int x,int y){return 1ll*inf*(x/B)+1ll*(y/B);}
il void add(int i){
    ll w=id(a[i].fi,a[i].se);
    if(!mp.count(w)) mp[w]=++cnt;
    e[mp[w]].push_back({a[i].fi,a[i].se});
}
int x,y,z,u,v,w;ll mi;ll p,q,r;
int main(){
    //freopen("P1429_1.in","r",stdin);
    mt19937 rnd(time(0));
    scanf("%d",&n);
    for(int i=1;i<=n;++i) scanf("%d%d",&a[i].fi,&a[i].se);
    shuffle(a+1,a+1+n,rnd);
    ans=dis(a[1],a[2]),B=sqrtl(ans)+1,add(1),add(2);
    for(int i=3;i<=n;++i){
        mi=oo,u=a[i].fi/B,v=a[i].se/B;
        for(int j=0;j<9;++j){
            if(u+dx[j]<0 || v+dy[j]<0) continue;
            w=mp[1ll*(u+dx[j])*inf+(v+dy[j])];if(!w) continue;
            for(pii it:e[w]) mi=min(mi,dis(a[i],it));
        }
        if(mi>=ans){add(i);continue;}
        for(int j=1;j<=cnt;++j) e[j].clear();mp.clear();cnt=0;
        ans=mi,B=sqrtl(ans)+1;
        for(int j=1;j<=i;++j){
            p=1ll*(a[j].fi/B)*inf+(a[j].se/B),u=mp[p];if(!u) mp[p]=++cnt,u=cnt;
            e[u].push_back({a[j].fi,a[j].se});
        }
        //if(clock()>1900000){double dd=sqrtl(ans);printf("%.15lf",dd);exit(0);}
    }
    double dd=sqrtl(ans);
    printf("%.15lf",dd);
    return 0;
}