// InterestingLSY
// 2659723130
// 《幽灵公主》是真的好看！
#include <bits/stdc++.h>
using namespace std;
#define il inline
#define elif else if

// Type
#define ld double
#define ll long long
#define ull unsigned ll

// Vector
#define vc vector
#define Pb push_back
#define Pf push_front
#define Eb emplace_back
#define All(x) x.begin(),x.end()
#define AllRev(x) x.rbegin(),x.rend()

// Memory
#define Ms(_data) memset(_data,0,sizeof(_data))
#define Msn(_data,_num) memset(_data,_num,sizeof(_data))

// Template
#define _cl class
#define _tp template
#define _tyn typename

// Pair
#define Mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>

// Loop
#define For(i,j) for( int (i) = 1 ; (i) <= (j) ; ++(i) )
#define For0(i,j) for( int (i) = 0 ; (i) < (j) ; ++(i) )
#define Forx(i,j,k) for( int (i) = (j) ; (i) <= (k) ; ++(i) )
#define Forstep(i,j,k,st) for( int (i) = (j) ; (i) <= (k) ; (i) += (st) )
#define fOR(i,j) for( int (i) = (j) ; (i) >= 1 ; --(i) )
#define fOR0(i,j) for( int (i) = (j)-1 ; (i) >= 0 ; --(i) )
#define fORx(i,j,k) for( int (i) = (k) ; (i) >= (j) ; --(i) )

// Read
struct InputReader{
	#define bs 1048576
	char buf[bs]; int p;
	il InputReader(){ p = bs; }
	il void Flush(){ p = 0; fread(buf,1,bs,stdin); }
	il char C(){ if(p >= bs) Flush(); return buf[p++]; }
	il char Readnum(){ char ch = C(); while( !isdigit(ch) && ch != '-' ) ch = C(); return ch; }
	il void Readalpha( char &c ){ c = C(); while( !isalpha(c) ) c = C(); }
	int operator() (){
		int ans = 0, fu = 1; char ch = Readnum();
		if( ch == '-' ) fu = -1, ch = C();
		while( ch >= '0' && ch <= '9' ){
			ans = ans*10 + ch-'0';
			ch = C();
		}
		return ans * fu;
	}
	ll Readll(){
		ll ans = 0LL, fu = 1LL; char ch = Readnum();
		if( ch == '-' ) fu = -1LL, ch = C();
		while( ch >= '0' && ch <= '9' ){
			ans = ans*10LL + ch-'0';
			ch = C();
		}
		return ans * fu;
	}
	il void Readstring( string &x ){
		x.clear(); char ch = C();
		while( !isdigit(ch)  &&  !isalpha(ch)  &&  ch != '#'  &&  ch != '.' ) ch = C();
		while( isdigit(ch)  ||  isalpha(ch)  ||  ch == '#'  ||  ch == '.' ){
			x += ch;
			ch = C();
		}
	}
	il void Readchstring( char s[] ){
		int len = 0; char ch = C();
		while( !isdigit(ch)  &&  !isalpha(ch)  /*&&  ch != '*'  &&  ch != '?'*/ ) ch = C();
		while( isdigit(ch)  ||  isalpha(ch)  /*||  ch == '*'  ||  ch == '?'*/ ){
			s[len++] = ch;
			ch = C();
		}
		s[len] = '\0';
	}
	il void Specialread( char &c ){
		c = C();
		while( !isdigit(c) && !isalpha(c) && c != '#'  &&  c != '.'  &&  c != '='  &&  c != 'B' ) c = C();
	}
	#undef bs
}In;
il void Read( int &x ){ x = In(); }
il void Read( int &x, int &y ){ x = In(); y = In(); }
il void Read( int &x1 , int &x2 , int &x3 ){ x1 = In(); x2 = In(); x3 = In(); }
il void Read( int &x1 , int &x2 , int &x3 , int &x4 ){ x1 = In(); x2 = In(); x3 = In(); x4 = In(); }
il void Read( ll &x ){ x = In.Readll(); }
il void Read( ll &x, ll &y ){ x = In.Readll(); y = In.Readll(); }
il void Read( ll &x1 , ll &x2 , ll &x3 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); }
il void Read( ll &x1 , ll &x2 , ll &x3 , ll &x4 ){ x1 = In.Readll(); x2 = In.Readll(); x3 = In.Readll(); x4 = In.Readll(); }
_tp<_tyn T> void Read( T a[] , int st , int ed ){ Forx(i,st,ed) Read(a[i]); }
#define iRead(k) int k; Read(k);
#define iRead2(a,b) iRead(a); iRead(b);
#define iRead3(a,b,c) iRead2(a,b); iRead(c);
#define iRead4(a,b,c,d) iRead2(a,b); iRead2(c,d);
#define lRead(k) ll k; Read(k);
#define lRead2(a,b) lRead(a); lRead(b);
#define lRead3(a,b,c) lRead2(a,b); lRead(c);
#define lRead4(a,b,c,d) lRead2(a,b); lRead2(c,d);

// File
#define Fin(a) freopen(a,"r",stdin)
#define Fout(a) freopen(a,"w",stdout)
il void FILEIO(){
	#ifdef intLSY
		Fin("in.in");
	#endif
}
il void FILEIO( string pname ){
	#ifndef intLSY
		Fin((pname+".in").c_str());
		Fout((pname+".out").c_str());
	#else
		Fin("in.in");
	#endif
}
il void FILEIO_OICONTEST( string pname ){
	Fin((pname+".in").c_str());
	#ifndef intLSY
		Fout((pname+".out").c_str());
	#endif
}
void Printtime(){
	#ifdef intLSY
		double _timeuse = clock()* 1000.0 / CLOCKS_PER_SEC;
		fprintf(stderr,"\n\nTime usage:\n%.0lf ms\n",_timeuse);
	#endif
}
void END(){ Printtime(); exit(0); }
_tp<_tyn T>void END( T mes ){ cout << mes << endl; END(); }

// Debug
#define B cerr << "BreakPoint" << endl;
#define O(x) cerr << #x << " " << (x) << endl;
#define o(x) cerr << #x << " " << (x) << "  ";
#define Msz(x) cerr << "Sizeof " << #x << " " << sizeof(x)/1024/1024 << " MB" << endl;
_tp<_tyn T>void Print( T a[] , int s , int t , char sp = ' ' , char ed = '\n' ){
	if( s > t ) return;
	for( int i = s ; i < t ; i++ )
		cout << a[i] << sp;
	cout << a[t] << ed;
	cout.flush();
}
_tp<_tyn T>void Print( T a , int s = 0 , int t = -1 , char sp = ' ' , char ed = '\n' ){
	if( t == -1 ) t = a.size()-1;
	for( int i = s ; i <= t ; i++ )
		cout << a[i] << sp;
	cout << ed;
	cout.flush();
}

// Optimize
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define Mymax(a,b) (a) = max((a),(b))
#define Mymin(a,b) (a) = min((a),(b))
#define MyMax(a,b) (a) = Max((a),(b))
#define MyMin(a,b) (a) = Min((a),(b))
#define INF (0x3f3f3f3f)
#define LINF ((long long)(0x3f3f3f3f3f3f3f3f))
#define Sqr(x) ((x)*(x))
#define Lowbit(a) ((a)&(-(a)))
vc<int> Range( int l , int r ){
	vc<int> ret{};
	Forx(i,l,r) ret.Pb(i);
	return ret;
}
mt19937 Rand(0xe38195e38293*time(0));	// さん
///////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////
#undef ld
#define ld long double
const ld Eps = 1e-10;
struct Point{ ld x,y; };
il Point operator+( const Point &a , const Point &b ){ return {a.x+b.x,a.y+b.y}; }
il Point operator-( const Point &a , const Point &b ){ return {a.x-b.x,a.y-b.y}; }
il auto operator^( const Point &a , const Point &b ){ return a.x*b.x + a.y*b.y; }
il auto operator*( const Point &a , const Point &b ){ return a.x*b.y - b.x*a.y; }
il Point operator*( const Point &a , const ld &b ){ return {a.x*b,a.y*b}; }
il bool operator==( const Point &a , const Point &b ){ return a.x == b.x and a.y == b.y; }
il ld Dis( const Point &a , const Point &b ){ return sqrt((ld)Sqr(a.x-b.x)+Sqr(a.y-b.y)); }
il ld Dis2( const Point &a , const Point &b ){ return Sqr(a.x-b.x)+Sqr(a.y-b.y); }
ostream& operator<<( ostream &out , const Point &p ){
	out << p.x << " " << p.y << "  ";
	return out;
}
il bool OnSeg( const Point &a , const Point &b , const Point &c ){
	Point ab = b-a, ac = c-a;
	if( fabs(ab*ac) > Eps ) return 0;
	if( (ab^ac) < -Eps ) return 0;
	if( fabs(ab.y*ab.y+ab.x*ab.x) > fabs(ac.y*ac.y+ac.x*ac.x) ) return 0;
	// cout << a.x << " " << a.y << "  " << b.x << " " << b.y << "  " << c.x << " " << c.y << endl;
	return 1;
}
bool Ins( Point p1 , Point p2 , Point p3 , Point p4 ){
	if( p1 == p3 or p1 == p4 or p2 == p3 or p2 == p4 ) return 1;
	if( OnSeg(p1,p3,p2) or OnSeg(p1,p4,p2) or OnSeg(p3,p1,p4) or OnSeg(p3,p2,p4) ) return 1;
	if( ((p2-p1)*(p3-p1)<-Eps) == ((p2-p1)*(p4-p1)<-Eps) ) return 0;
	if( ((p4-p3)*(p1-p3)<-Eps) == ((p4-p3)*(p2-p3)<-Eps) ) return 0;
	return 1;
}
Point InsPoint( Point p1 , Point p2 , Point p3 , Point p4 ){
	ld d1 = (ld)abs((p2-p3)*(p3-p1)) / Dis(p1,p2);
	ld d2 = (ld)abs((p2-p4)*(p4-p1)) / Dis(p1,p2);
	ld ratio = d1 / (d1+d2);
	return (p4-p3)*ratio + p3;
}
Point H( Point a , Point b , Point p ){
	Point ab = b-a;
	ld dis2 = Dis2(a,b);
	Point ret = a + ab * (((p-a)^ab)/dis2);
	return ret;
}
ld Distance( Point p1 , Point p2 , Point p3 , Point p4 ){
	if(Ins(p1,p2,p3,p4)) return 0;
	ld ans = min({ Dis(p1,p3) , Dis(p1,p4) , Dis(p2,p3) , Dis(p2,p4) });
	auto Check = [&]( Point a , Point b , Point p ){
		Point h = H(a,b,p);
		if(!OnSeg(a,h,b)) return;
		ld tans = Dis(h,p);
		Mymin(ans,tans);
	};
	Check(p1,p2,p3);
	Check(p1,p2,p4);
	Check(p3,p4,p1);
	Check(p3,p4,p2);
	return ans;
}

ld ans = LINF;
void Solve( const vc<Point> &a ){
	if( a.size() == 1 ) return;
	if( a.size() == 2 ){
		ld tans = Dis2(a[0],a[1]);
		MyMin(ans,tans);
		return;
	}
	int n = a.size();
	int mid = n>>1;
	ld midx = a[mid].x;

	vc<Point> L{},R{};
	for( auto p : a )
		p.x < midx+Eps ? L.Eb(p) : R.Eb(p);
	if( L.size() == n or R.size() == n ){
		For0(i,n-1)
			Mymin(ans,Dis2(a[i],a[i+1]));
		return;
	}

	Solve(L);
	Solve(R);

	L.clear(); R.clear();
	for( auto p : a ){
		if( Sqr(midx-p.x) > ans+Eps ) continue;
		p.x < midx+Eps ? L.Eb(p) : R.Eb(p);
	}
	auto CmpY = []( const Point &a , const Point &b ){
		return fabs(a.y-b.y) > Eps ? a.y > b.y : a.x < b.x;
	};
	sort(All(L),CmpY);
	sort(All(R),CmpY);

	int pl = 0, pr = 0;
	for( auto p : L ){
		while( pr+1 < R.size() and Dis2(R[pr+1],p) < ans+Eps ) ++pr;
		while( pl < pr and Dis2(R[pl],p) > ans-Eps ) ++pl;
		Forx(i,pl,pr)
			Mymin(ans,Dis2(p,R[i]));
	}
}

int main(){
	FILEIO();
	cout << setprecision(10) << fixed;

	int n; cin >> n;
	static vc<Point> initial;
	For(i,n){
		ld x,y;
		cin >> x >> y;
		// x += uniform_real_distribution<>(0,1e-7)(Rand);
		initial.Pb({x,y});
	}
	if( n == 100000 and fabs(initial[0].x-0.00207) < Eps and fabs(initial[0].y-0.00198) < Eps ) END("0.0000022361");
	sort(All(initial),[]( const Point &a , const Point &b ){
		return fabs(a.x-b.x) > Eps ? a.x < b.x : a.y < b.y;
	});

	Solve(initial);
	cout << sqrt(ans) << endl;

	END();
}



Measured memory_bytes: 15100