#include<cstdio>
#include<algorithm>
#include<cmath>
struct point {
	int x, y;
}w[110];
using namespace std;
int n;
double P[210];
const double PI = acos(-1.0);
int main() {
	int i, j;
	scanf("%d", &n);
	for (i = 1; i <= n; i++) {
		scanf("%d%d", &w[i].x, &w[i].y);
	}
	for (i = 1; i <= n; i++) {
		int cnt = 0;
		for (j = 1; j <= n; j++) {
			if (i == j)continue;
			P[cnt++] = atan2(w[j].y - w[i].y, w[j].x - w[i].x);
		}
		sort(P, P + cnt);
		for (j = 0; j < cnt; j++)P[j + cnt] = P[j] + 2 * PI;
		double res = 0.0;
		for (j = 0; j < cnt; j++) {
			res = max(res, PI - P[j + cnt - 1] + P[j]);
		}
		printf("%.10f\n", res/(2*PI));
	}
}