#include<iostream>
#include<stdlib.h> /* qsort */
#include <stdio.h> /* printf */
#include <math.h>
#include <queue>
#include <iomanip>
#include <string>
//#include <conio.h>
//#include <ctype>
using namespace std;
#define NMAX 100002
struct punct
{
	int x, y;
}p[NMAX];
double dist(punct p1, punct p2)
{
	return sqrt((double)((long long)((long long)p1.x-p2.x)*(p1.x-p2.x)+(long long)((long long)p1.y-p2.y)*(p1.y-p2.y)));
}
int main()
{
	int n;
	FILE *f = fopen("cmap.in", "r");
	FILE *g = fopen("cmap.out", "w");
	fscanf(f, "%d", &n);
	for (int i=1; i<=n; i++)
	{
		fscanf(f, "%d%d", &p[i].x, &p[i].y);
	}
	double dMin = dist(p[1], p[2]); 
	for (int i=1; i<n; i++)
		for (int j=i+1; j<=n; j++)
		{
			double d = dist(p[i], p[j]);
			if (dMin > d)
				dMin = d;
		}
	fprintf(g, "%lf", dMin);

	fclose(f);
	fclose(g);
	return 0;
}