#include <bits/stdc++.h>
#include <random>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<int, ll> i_ll;
typedef pair<ll, ll> ll_ll;
typedef pair<double, int> d_i;
const int MOD = 1e9 + 7;
const ll INF = LLONG_MAX / 10;
struct edge { int v, w; };

int main() {
	int N; cin >> N;
	vector<ll> x(N), y(N);
	rep(i, N) cin >> x[i] >> y[i];
	double pi = acos(-1);
	rep(i, N) {
		vector<double> a;
		rep(j, N) if (j != i) a.pb(atan2(y[j] - y[i], x[j] - x[i]));
		sort(a.begin(), a.end());
		rep(i, N - 1) a.pb(a[i] + pi * 2);
		sort(a.begin(), a.end());
		double ma = 0;
		for (int i = 0; i + 1 < (N - 1) * 2; i++)
			ma = max(ma, a[i + 1] - a[i]);
		ma = max(0.0, ma - pi);
		printf("%.15f\n", ma / pi / 2);
	}
}
