#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
set<pair<int,int> >se;
struct dian
{
	int x,y;
}d[2000005];
bool bi(struct dian c,struct dian d)
{
	if(c.x!=d.x)return c.x<d.x;
	return c.y<d.y;
}
int main()
{
	int n;
	n=read();
	for(int i=1;i<=n;i++)
	{
		d[i].x=read();
		d[i].y=read();
	}
	sort(d+1,d+n+1,bi);
	int nl=1;
	__int128 ans=1;
	for(int i=1;i<=30;i++)ans*=10;
	for(int i=1;i<=n;i++)
	{
		while(nl<i&&(__int128)(d[i].x-d[nl].x)*(d[i].x-d[nl].x)>ans)
		{
			se.erase(make_pair(d[nl].y,nl));
			nl++;
		}
		if(se.empty())
		{
			se.insert(make_pair(d[i].y,i));
			continue;
		}
		set<pair<int,int> >::iterator it=se.lower_bound(make_pair(d[i].y,0));
		for(set<pair<int,int> >::iterator nit=it;nit!=se.end();nit++)
		{
			if((__int128)(nit->first-d[i].y)*(nit->first-d[i].y)>ans)break;
			int now=nit->second;
			ans=min(ans,(__int128)(d[i].x-d[now].x)*(d[i].x-d[now].x)+(__int128)(d[i].y-d[now].y)*(d[i].y-d[now].y));
		}
		for(set<pair<int,int> >::iterator nit=it;;nit--)
		{
			if(nit==se.end())nit--;
			if((__int128)(d[i].y-nit->first)*(d[i].y-nit->first)>ans)break;
			int now=nit->second;
			ans=min(ans,(__int128)(d[i].x-d[now].x)*(d[i].x-d[now].x)+(__int128)(d[i].y-d[now].y)*(d[i].y-d[now].y));
			if(nit==se.begin())break;
		}
		se.insert(make_pair(d[i].y,i));
	}
	printf("%.9Lf\n",sqrt((long double)ans));
	return 0;
}