#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif

#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound

typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }

vector<int> get_bits(int mask) {
	vector<int> bb;
	while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
	reverse(all(bb));
	return bb;
}

int get_mask(vector<int> v) {
	int mask = 0;
	for(int x : v) { mask ^= (1 << x); }
	return mask;
}

template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll rand(ll l, ll r){
	uniform_int_distribution<ll> uid(l, r);
	return uid(rng);
}

void sc() {}

template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }

#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

// #ifndef LOCAL
// string to_string(__int128 x) {
// 	string s = "";
// 	bool neg = 0;
// 	if(x < 0) { s += "-"; neg = 1; x = -x; }
// 	if(!x) s += '0';
// 	while(x) {
// 		int rem = x % 10;
// 		s += to_string(rem);
// 		x /= 10;
// 	}
// 	reverse(s.begin() + neg, s.end());
// 	return s;
// }
// #endif

const int mod = 1e9 + 7; // 998244353;

int pwr(int a,ll b) {
	int ans = 1;
	while(b) {
		if(b & 1) ans = (ans * 1LL * a) % mod;
		a = (a * 1LL * a) % mod;
		b >>= 1;
	}
	return ans;
}

/*
	Lookout for overflows!!
	Check array sizes!!
	Clear before test cases!!
	Use the correct modulo!!
	Check for corner cases!!
	Are you forgetting something?!
	Read problem statement carefully!!!
*/

ll cross(pll a, pll b) {
    return a.fi * b.se - a.se * b.fi;
}

pll sub(pll a, pll b) {
    return {a.fi - b.fi, a.se - b.se};
}

vector<pll> up, down;

void ConvexHull(vector<pll> &v) {
    up.clear();
    down.clear();
    sort(all(v));
    v.resize(unique(all(v)) - v.begin());
    if(sz(v) == 1) return;
    pll a = v[0], b = v.back();
    up.pb(a);
    down.pb(a);
    fr(i, 1, sz(v) - 1) {
        ll c = cross(sub(v[i], a), sub(b, v[i]));
        if((i == sz(v) - 1) || (c < 0)) {
            while(sz(up) >= 2 && cross(sub(up.back(), up[sz(up) - 2]), sub(v[i], up.back())) >= 0) {
                up.pop_back();
            }
            up.pb(v[i]);
        }
        if((i == sz(v) - 1) || (c > 0)) {
            while(sz(down) >= 2 && cross(sub(down.back(), down[sz(down) - 2]), sub(v[i], down.back())) <= 0) {
                down.pop_back();
            }
            down.pb(v[i]);
        }
    }
    v = down;
    for(int i = sz(up) - 2; i > 0; i--) {
        v.pb(up[i]);
    }
}

bool inside(pll x) {
    auto it = upper_bound(all(up), x);
    int idx = it - up.begin();
    if(idx == 0) return 0;
    if(idx == sz(up)) return 0;
    pll a = up[idx - 1], b = up[idx];
    if(cross(sub(x, a), sub(b, x)) < 0) return 0;
    it = upper_bound(all(down), x);
    idx = it - down.begin();
    if(idx == 0) return 0;
    if(idx == sz(down)) return 0;
    a = down[idx - 1], b = down[idx];
    if(cross(sub(x, a), sub(b, x)) > 0) return 0;
    return 1;
}

map<pii,int> idx;
const int N = 105;
f80 ans[N];

const f80 PI = acos(-1);

void solve() {
    cout << setprecision(10) << fixed;
	int n;
    sc(n);
    vector<pll> v;
    fr(i, 1, n) {
        int x, y;
        sc(x, y);
        idx[{x, y}] = i;
        v.pb({x, y});
    }
    ConvexHull(v);
    if(sz(v) == 2) {
        ans[idx[v[0]]] = 0.5;
        ans[idx[v[1]]] = 0.5;
        fr(i, 1, n) {
            cout << ans[i] << endl;
        }
        return;
    }
    debug(v);
    int nn = sz(v);
    f80 tot = 0;
    fr(i, 0, sz(v) - 1) {
        pll v1 = sub(v[(i + 1) % nn], v[i]);
        pll v2 = sub(v[(i - 1 + nn) % nn], v[i]);
        f80 ang = cross(v1, v2);
        ang /= sqrtl(v1.fi * v1.fi + v1.se * v1.se);
        ang /= sqrtl(v2.fi * v2.fi + v2.se * v2.se);
        debug(ang);
        ang = min(ang, f80(1));
        ang = max(ang, f80(-1));
        ang = asin(ang);
        if(v1.fi * v2.fi + v1.se * v2.se < 0) ang = PI - ang;
        debug(v[i], (180.0 / PI) * ang);
        debug(v1, v2);
        ang = PI - ang;
        tot += ang;
        ans[idx[v[i]]] = ang;
    }
    fr(i, 1, n) {
        ans[i] /= tot;
        cout << ans[i] << endl;
    }
}

int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	// cin >> t;
	for(int tt = 1; tt <= t; tt++) {
		solve();
	}
	return 0;
}

Measured memory_bytes: 3860