#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#define my_abs(x) ((x) < 0 ? -(x) : (x))
#define mp std::make_pair
#define pb push_back
#define X first
#define Y second
typedef long long ll; 
int x[105], y[105]; 
double seq[205]; 
int main()
{
	// freopen("AGC021-B.in", "r", stdin); 
	int n; 
	scanf("%d", &n); 
	for (int i = 0; i < n; i++)
		scanf("%d%d", x + i, y + i); 
	for (int i = 0; i < n; i++)
	{
		int cnt = 0; 
		for (int j = 0; j < n; j++)
		{
			if (i != j)
				seq[cnt++] = atan2(y[j] - y[i], x[j] - x[i]); 
		}
		std::sort(seq, seq + cnt); 
		for (int j = 0; j < cnt; j++)
			seq[j + cnt] = seq[j] + acos(-1) * 2; 
		double mx = 0; 
		for (int j = 1; j <= cnt; j++)
			mx += std::max(seq[j] - seq[j - 1] - acos(-1), 0.0); 
		printf("%.20lf\n", mx / acos(-1) / 2);
	}
	return 0; 
}
