#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
bool vis[1000];
double x[1000],y[1000];
int n;
int cnt;
struct node{
int u,v;
double dis;
}edge[500000];
int cmp(node a,node b)
{
return a.dis>b.dis;
}
void cul(int u,int v)
{
edge[cnt].u=u;
edge[cnt].v=v;
double l1=x[u],d1=y[u],l2=x[v],d2=y[v];
double p = acos(-1.0);
l1 *= p/180.0; d1 *= p/180.0;
l2 *= p/180.0; d2 *= p/180.0;
edge[cnt].dis=acos(cos(l1)*cos(l2)*cos(d1-d2)+sin(l1)*sin(l2));
cnt++;
}
i