#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) REP(sz, vec.size()) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');

const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;

int is_clockwise(pair<ll, ll> x, pair<ll, ll> y, pair<ll, ll> z) {
    pair<ll, ll> a = {y.first - x.first, y.second - x.second},
                   b = {z.first - x.first, z.second - x.second};
    if (a.first * b.second - a.second * b.first < -(1e-10)) return 1;
    else return 0;
}

template < typename T >
vector< P< pair<T, T>, int > > andrew_cht(vector< P< pair<T, T>, int > > s) {
    vector< P< pair<T, T>, int > > u, l;
    V<int> uid, lid;
    if (s.size() < 3) return s;
    sort(s.begin(), s.end());

    // 凸包の上側を作成
    u.push_back(s[0]);
    u.push_back(s[1]);
    for (int i = 2; i < s.size(); i++) {
        for (int n = u.size(); n >= 2 && is_clockwise(u[n - 2].first, u[n - 1].first, s[i].first) == 1; n--) {
            u.pop_back();
        }
        u.push_back(s[i]);
    }

    // 凸包の下側を作成
    l.push_back(s[s.size() - 1]);
    l.push_back(s[s.size() - 2]);
    for (int i = s.size() - 3; i >= 0; i--) {
        for (int n = l.size(); n >= 2 && is_clockwise(l[n - 2].first, l[n - 1].first, s[i].first) == 1; n--) {
            l.pop_back();
        }
        l.push_back(s[i]);
    }

    // 時計回りになるよう点列を作成
    for (int i = 1; i < l.size() - 1; i++) u.push_back(l[i]);

    return u;
}

const long double PI = 3.14159265359;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    V< P< P<ll, ll> , int > > xy(n);
    for (int i = 0; i < n; i++) {
        cin >> xy[i].first.first >> xy[i].first.second;
        xy[i].second = i;
    }

    V< P< P<ll, ll>, int > > cht = andrew_cht(xy);
    int sz = cht.size();
    V<double> ans(n, 0.0);
    for (int i = 0; i < sz; i++) {
        P< P< ll, ll >, int > prev = cht[(i - 1 + sz) % sz], post = cht[(i + 1) % sz];
        ll prevx = prev.first.first - cht[i].first.first, prevy = prev.first.second - cht[i].first.second,
               postx = post.first.first - cht[i].first.first, posty = post.first.second - cht[i].first.second;
        double cosss = ((double)prevx * postx + prevy * posty) / (sqrt((double)prevx * prevx + prevy * prevy) * sqrt((double)postx * postx + posty * posty));
        double theta = acos(cosss);
        ans[cht[i].second] = (PI - theta) / (2.0 * PI);
    }
    
    for (int i = 0; i < n; i++) cout << fixed << setprecision(12) << ans[i] << '\n';
    return 0;
}


Measured memory_bytes: 512