/*Considera(m un plan euclidian ce cont,ine n puncte date prin coordonatele lor.
 Distant,a euclidiana( dintre doua( puncte A(x_{1}, y_{1}) s,i B (x_{2}, y_{2}) 
se calculeaza( conform formulei: \sqrt{(x_{1} - x_{2})^2 + (y_{1} - y_{2})^2} .
Cerint,a(
Sa( se determine distant,a dintre cele mai apropiate doua( puncte. */ 
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream in("cmap.in");
ofstream out("cmap.out");
int main(){
	int j,n,i;
	double dmin,d,v[100000];
	in>>n;
	for(i=1;i<=n*2;i++) in>>v[i];
	dmin=sqrt((v[1]-v[3])*(v[1]-v[3])+(v[2]-v[4])*(v[2]-v[4]));
	for(i=1;i<=n*2;i=i+2)
	for(j=i;j<=n*2;j=j+2){
		d=sqrt((v[i]-v[j+2])*(v[i]-v[j+2])+(v[i+1]-v[j+3])*(v[i+1]-v[j+3]));
		if(dmin>d) dmin=d;
	}
	out<<dmin;
}