#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}
#define pb push_back
#define int long long
#define INF 1000000000000000000

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};

int mod = 1000000007;
//int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
#define AddMult(x, y, z) x = (x + (y) * (z)) % mod

vec convex_hull(vector<Pii> &x){
    int n = x.size();
    vector<PPi> x_(n);
    REP(i, n) x_[i] = PPi(x[i], i);
    Sort(x_);
    int k = 0;
    vec qs(2 * n);
    //下側
    REP(i, n){
        while(k > 1){
            int x1 = x[qs[k - 1]].first - x[qs[k - 2]].first;
            int y1 = x[qs[k - 1]].second - x[qs[k - 2]].second;
            int x2 = x_[i].first.first - x[qs[k - 1]].first;
            int y2 = x_[i].first.second - x[qs[k - 1]].second;
            if(x1 * y2 - x2 * y1 <= 0) k--;
            else break;
        }
        qs[k++] = x_[i].second;
    }
    int t = k;
    //上側
    IREP(i, n - 1){
        while(k > t){
            int x1 = x[qs[k - 1]].first - x[qs[k - 2]].first;
            int y1 = x[qs[k - 1]].second - x[qs[k - 2]].second;
            int x2 = x_[i].first.first - x[qs[k - 1]].first;
            int y2 = x_[i].first.second - x[qs[k - 1]].second;
            if(x1 * y2 - x2 * y1 <= 0) k--;
            else break;
        }
        qs[k++] = x_[i].second;
    }
    qs.resize(k - 1);
    return qs;
}

signed main(){

    int N; cin >> N;
    pairs x(N);
    REP(i, N){
        cin >> x[i].first >> x[i].second;
    }
    vec ch = convex_hull(x);
    int n = SZ(ch);
    //vdebug(ch);
    vector<double> ans(N, 0.0);
    REP(i, n){
        double v1x = x[ch[(i + 1) % n]].first - x[ch[i]].first;
        double v1y = x[ch[(i + 1) % n]].second - x[ch[i]].second;
        double v2x = x[ch[(i - 1 + n) % n]].first - x[ch[i]].first;
        double v2y = x[ch[(i - 1 + n) % n]].second - x[ch[i]].second;
        double ip = (v1x * v2x + v1y * v2y) / (sqrt(v1x * v1x + v1y * v1y) * sqrt(v2x * v2x + v2y * v2y));
        if(abs(ip) < 1.0) ans[ch[i]] = (M_PI - acos(ip)) / (2.0 * M_PI);
        else if(ip >= 1.0) ans[ch[i]] = 0.5;
        else ans[ch[i]] = 0.0;
    }
    REP(i, N) cout << ans[i] << endl;

    return 0;
}


Measured memory_bytes: 256