#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=100+2;
const double pie=acos(-1.);
int n;
int x[maxn],y[maxn];
double st[maxn];
int main(){
	scanf("%d",&n);
	for (int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
	for (int i=1;i<=n;i++){
		int tot=0;
		for (int j=1;j<=n;j++)
			if (i^j) st[++tot]=atan2(x[j]-x[i],y[j]-y[i]);
		sort(st+1,st+tot+1);
		st[0]=st[tot]-2*pie;
		double ans=0;
		for (int j=1;j<=n;j++) ans=max(ans,st[j]-st[j-1]-pie);
		printf("%.18lf\n",ans/2./pie);
	}
	return 0;
}