#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
struct Point{int x,y;bool operator==(const Point&s)const{return x==s.x&&y==s.y;}}a[N];int n;
struct myhash{size_t operator()(const Point&s)const{return s.x+s.y*1334256779ll;}};
unordered_map<Point,vector<Point>,myhash>M;
long double ans;
long double dist(const Point&A,const Point&B){return sqrtl((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));}
inline Point get_id(const Point&A){return {(int)floorl(A.x/ans),(int)floorl(A.y/ans)};}
inline void reb(int x){M.clear();for(int i=1;i<=x;++i)M[get_id(a[i])].push_back(a[i]);}
int main()
{
    cin>>n;
    for(int i=1;i<=n;++i)cin>>a[i].x>>a[i].y;
    shuffle(a+1,a+n+1,mt19937(234));
    ans=dist(a[1],a[2]);reb(2);
    for(int i=3;i<=n;++i)
    {
        // cerr<<i<<": "<<ans<<endl;
        auto k=get_id(a[i]);vector<Point>A;
        auto merge=[&](const Point&X){if(M.count(X))for(auto k:M[X])A.push_back(k);};
        for(int o=-1;o<=1;++o)for(int t=-1;t<=1;++t)merge({k.x+o,k.y+t});
        long double mn=ans;
        for(auto k:A)mn=min(mn,dist(a[i],k));
        // cerr<<"ED: "<<mn<<" "<<ans<<endl;
        if(mn<ans)ans=mn,reb(i);else M[k].push_back(a[i]);
    }
    printf("%.20Lf\n",ans);
    return 0;
}