#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <iostream>
#include <set>
#include <map>
#include <string>
#include <algorithm>

using namespace std;

#define ll long long int
#define Pi pair<int, int>
#define Pid pair<int, double>
#define Pdi pair<double, int>
#define Pd pair<double, double>
#define Pl pair<ll, ll>

const int mod = 1e9+7;
const int INF = 2e9;
const double epsilon = 1e-7;
const double PI = 3.1415926535;

ll mi(ll x, ll y){
    if(x<y)return x;
    return y;
}

int main() {
	int n; cin >> n;
	vector<Pi> a(n);
	for(int i = 0;i < n;i++) cin >> a[i].first >> a[i].second;
	for(int i = 0;i < n;i++) {
		int idx = 0;
		double b[201];
		for(int j = 0;j < n;j++) {
			if (i == j) continue;
			b[idx++] = atan2(a[j].second - a[i].second, a[j].first - a[i].first);
		}
		sort(b, b + idx);
		for(int j = 0;j < idx;j++) b[j + idx] = b[j] + 2 * PI;
		double ans = 0;
		for(int j = 0;j < idx;j++)ans = max(ans, PI - b[j + idx - 1] + b[j]);
		printf("%.12f\n", ans/2/PI);
	}
	return 0;
}
