#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
const double pi = acos(-1.);
const int N = 105;
int n, x[N], y[N];
double p[N + N];
signed main()
{
    cin >> n;
    for (int i = 0; i < n; i++)cin >> x[i] >> y[i];
    for (int i = 0; i < n; i++)
    {
        int tot = 0;
        for (int j = 0; j < n; j++)
            if (i != j)p[tot++] = atan2(y[j] - y[i], x[j] - x[i]);
        sort(p, p + tot);
        for (int j = 0; j < tot; j++)p[j + tot] = p[j] + 2 * pi;
        double ans = 0;
        for (int j = 0; j < tot; j++)ans = max(ans, pi - p[j + tot - 1] + p[j]);
        printf("%.8f\n", ans / 2 / pi);
    }
    return 0;
}
