///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}

template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(V<ll> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(V<t2> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(V<t3> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(V<t4> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(V<ll> &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

template <typename T>
void _debug_print(T x)
{
    cout << x << endl;
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    printf("-- %s %02d:%02d:%02d.%06ld\n",
           prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}

double xy_distance(double x1, double y1, double x2, double y2)
{
    double xx = (x1 - x2) * (x1 - x2);
    double yy = (y1 - y2) * (y1 - y2);
    return sqrt(xx + yy);
}

double heron(double a, double b, double c)
{
    double s = (a + b + c) / 2.;
    double ret = 1.;
    ret *= s;
    ret *= (s - a);
    ret *= (s - b);
    ret *= (s - c);
    ret = sqrt(ret);
    return ret;
}

double rad_normarize(double rad)
{
    while (rad < -M_PI) rad += 2. * M_PI;
    while (rad > M_PI) rad -= 2. * M_PI;
    return rad;
}





///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

void calc_first(double &radmin, double &radmax, t2 xy1, t2 xy2)
{
    ll x1 = get<0>(xy1);
    ll y1 = get<1>(xy1);
    ll x2 = get<0>(xy2);
    ll y2 = get<1>(xy2);

    ll x = x1 - x2;
    ll y = y1 - y2;
    double rad = atan2((double)y, (double)x);
    debug_printf("first rad = %lf\n", rad);
    radmin = rad - M_PI / 2.;
    radmax = rad + M_PI / 2.;
}

bool calc(double &radmin, double &radmax, t2 xy1, t2 xy2)
{
    ll x1 = get<0>(xy1);
    ll y1 = get<1>(xy1);
    ll x2 = get<0>(xy2);
    ll y2 = get<1>(xy2);

    ll x = x1 - x2;
    ll y = y1 - y2;
    double rad = atan2((double)y, (double)x);
    debug_printf("rad = %lf\n", rad);
    double lradmin = rad - M_PI / 2.;
    double lradmax = rad + M_PI / 2.;

    double mmradmin = radmin;
    double mmradmax = radmax;
    double mmlradmin = lradmin;
    double mmlradmax = lradmax;

    rep (xx, 4) {
        if (radmin <= lradmin && lradmin <= radmax) {
            radmin = lradmin;
            return false;
        }
        lradmin += M_PI * 2.;
    }

    rep (xx, 8) {
        if (radmin <= lradmin && lradmin <= radmax) {
            radmin = lradmin;
            return false;
        }
        lradmin -= M_PI * 2.;
    }

    rep (xx, 4) {
        if (radmin <= lradmax && lradmax <= radmax) {
            radmax = lradmax;
            return false;
        }
        lradmax += M_PI * 2.;
    }

    rep (xx, 8) {
        if (radmin <= lradmax && lradmax <= radmax) {
            radmax = lradmax;
            return false;
        }
        lradmax -= M_PI * 2.;
    }

    rep (xx, 4) {
        if (mmlradmin <= mmradmin && mmradmin <= mmlradmax) return false;
        mmradmin += M_PI * 2.;
    }

    rep (xx, 8) {
        if (mmlradmin <= mmradmin && mmradmin <= mmlradmax) return false;
        mmradmin -= M_PI * 2.;
    }

    rep (xx, 4) {
        if (mmlradmin <= mmradmax && mmradmax <= mmlradmax) return false;
        mmradmax += M_PI * 2.;
    }

    rep (xx, 8) {
        if (mmlradmin <= mmradmax && mmradmax <= mmlradmax) return false;
        mmradmax -= M_PI * 2.;
    }

    return true;
}

void _main()
{
    ll n; llin(n);
    V<t2> xylist; llinl2(xylist, n);

    rep (i, n) {
        bool first = true;
        bool ng = false;
        double radmin, radmax;
        rep (j, n) {
            if (i == j) continue;
            if (first) calc_first(radmin, radmax, xylist[i], xylist[j]);
            else ng = calc(radmin, radmax, xylist[i], xylist[j]);
            first = false;
            debug_printf("i=%lld j=%lld ng=%d\n", i, j, ng);
            if (ng) break;
        }
        if (ng) cout << 0. << endl;
        else cout << (radmax - radmin) / (M_PI * 2.) << endl;
    }
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 4212