#include<iostream>
#include<fstream>
#include<math.h>
#include<algorithm>
using namespace std;
struct patrat {
	double d;
	short p1,p2;
};
struct punct {
	double x,y;
};
patrat v[1000001];
punct a[1001];
inline bool cmp(const patrat a, const patrat b) {
	return a.d<b.d;
}
int main ()
{
	int n,i,j,nr,l;
	patrat x;
	ifstream f("patrate3.in");
	ofstream g("patrate3.out");
	f>>n;
	for(i=1;i<=n;i++) 
		f>>a[i].x>>a[i].y;
	f.close();
	l=0;
	for(i=1;i<=n-1;i++) 
		for(j=i+1;j<=n;j++) {
			l++;
			v[l].d=(float)sqrt((float)(a[i].x-a[j].x)*(a[i].x-a[j].x)+(float)(a[i].y-a[j].y)*(a[i].y-a[j].y));
			v[l].p1=i;
			v[l].p2=j;
		}
	sort(v+1,v+l+1,cmp);
	g.close();
	return 0;
}