#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{long a[10000],b[10000],i,n,k=0,j;float c[399000],d=0;
	freopen("cmap.in","r",stdin);freopen("cmap.out","w",stdout);
	  scanf("%ld",&n);
	for(i=0;i<n;i++)
		scanf("%ld %ld",&a[i],&b[i]);
	for(i=0;i<n-1;i++)
		for(j=i+1;j<n;j++)
			{c[k]=sqrtl((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));k++;}
			d=(float)*min_element(c,c+(k-1));
			  printf("%.*f",6,d);
return 0;}