using namespace std;
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<climits>
#include<algorithm>
# define Nmax 100005
pair <int,int> P[Nmax];
int N;
void Read()
{
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		P[i]=make_pair(x,y);
	}
}
long long dist(pair <int,int> a,pair <int,int> b)
{
	return 1LL*(a.first-b.first)*(a.first-b.first)+1LL*(a.second-b.second)*(a.second-b.second);
}
long long Solve()
{
	long long Min=LLONG_MAX;
	for(int i=1;i<N;i++)
		for(int j=i+1;j<=N;j++)
		{
			Min=min(Min,dist(P[i],P[j]));
		}
	return Min;
}
int main()
{
	freopen("cmap.in","r",stdin);
	freopen("cmap.out","w",stdout);
	Read();
	printf("%lf\n",sqrt((double)Solve()));
	return 0;
}