// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
const dbl alpha=2.4;
const dbl c=cos(alpha),s=sin(alpha);
dbl X[2000005],Y[2000005];
uint P[2000005];
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
	uint n;scanf("%u",&n);
	dbl ans=1e25;
	for(uint i=0;i<n;i++){llt x,y;scanf("%lld%lld",&x,&y),x+=10000,y+=10000,X[i]=x,Y[i]=y,P[i]=i;}
	std::sort(P,P+n,[&](uint a,uint b){return X[a]*Y[a]<X[b]*Y[b];});
	for(uint i=0;i<n;i++)for(uint j=i+1;j<=i+100&&j<n;j++)
		_min(ans,(X[P[j]]-X[P[i]])*(X[P[j]]-X[P[i]])+(Y[P[j]]-Y[P[i]])*(Y[P[j]]-Y[P[i]]));
	for(uint i=0;i<n;i++){dbl x=X[i],y=Y[i];X[i]=x*c-y*s,Y[i]=y*c+x*s;}
	std::sort(P,P+n,[&](uint a,uint b){return X[a]<X[b];});
	for(uint i=0;i<n;i++)for(uint j=i+1;j<=i+100&&j<n;j++)
		_min(ans,(X[P[j]]-X[P[i]])*(X[P[j]]-X[P[i]])+(Y[P[j]]-Y[P[i]])*(Y[P[j]]-Y[P[i]]));
	ans=sqrt(ans);
	printf("%.7lf\n",ans);
	return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。