#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sign(int x) { return (x > 0) - (x < 0); }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

double normalize(double theta) {
    while (theta > 2 * PI) { theta -= 2 * PI; }
    while (theta < 0) { theta += 2 * PI; }
    return theta;
}
using P = pair<double, double>;
vector<P> merge(vector<P> a, vector<P> b) {
    vector<pair<double, int>> ps;
    for (P p:a) { ps.emplace_back(make_pair(p.first, 0)), ps.emplace_back(p.second, 0); }
    for (P p:b) { ps.emplace_back(make_pair(p.first, 1)), ps.emplace_back(p.second, 1); }
    sort(all(ps));
    double start;
    bool fa = false, fb = false;
    vector<P> ret;
    for (auto p:ps) {
        if (p.second == 0) {
            fa = !fa;
            if (fa && fb) { start = p.first; }
            if (!fa && fb) { ret.emplace_back(P(start, p.first)); }
        } else {
            fb = !fb;
            if (fa && fb) { start = p.first; }
            if (fa && !fb) { ret.emplace_back(P(start, p.first)); }
        }
    }
    return ret;
}
int N;
int x[110], y[110];
signed main() {
    cin >> N;
    rep(i, N) { cin >> x[i] >> y[i]; }
    rep(i, N) {
        vector<P> v;
        v.emplace_back(P(0, 2 * PI));
        rep(j, N) {
            if (i == j) { continue; }
            double start = normalize(atan2(y[i] - y[j], x[i] - x[j]) - PI / 2);
            double end = normalize(atan2(y[i] - y[j], x[i] - x[j]) + PI / 2);
            vector<P> cur;
            if (start < end) { cur.emplace_back(P(start, end)); }
            else { cur.emplace_back(P(0, end)), cur.emplace_back(P(start, 2 * PI)); }
            v = merge(v, cur);
        }
        double ans = 0;
        for (P p:v) { ans += p.second - p.first; }
        ans /= 2 * PI;
        cout << ans << endl;
    }

}

Measured memory_bytes: 4264