#include <iostream>
#include <vector>
#include <set>
#include <cmath>
using namespace std;

int n,m;

struct coord {
	int x, y;
};
multiset<int> s;
int main()
{
	cin >> n;

	vector<coord> v(n+1);
	for (int i = 1; i <= n; i++)
	{
		cin >> v[i].x >> v[i].y;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = i + 1; j <= n; j++)
		{
			s.insert((v[i].x - v[j].x) * 1ll * (v[i].x - v[j].x) + (v[i].y - v[j].y) * 1ll * (v[i].y - v[j].y));
		}	
	}
	cout << sqrt(*s.begin());
	return 0;
}