#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <functional>

using std::cin;
using std::cout;
using std::cerr;
using std::endl;

using std::map;
using std::set;
using std::bitset;
using std::vector;
using std::string;
using std::multimap;
using std::multiset;
using std::deque;
using std::queue;
using std::stack;
using std::pair;
using std::iterator;

using std::sort;
using std::stable_sort;
using std::reverse;
using std::max_element;
using std::min_element;
using std::unique;
using std::ios_base;
using std::swap;
using std::fill;

using std::setprecision;
using std::fixed;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef string S;

ll min(ll a, ll b) {return a < b ? a : b;}
ll min(int a, ll b) {return a < b ? a : b;}
ll min(ll a, int b) {return a < b ? a : b;}
ll min(int a, int b) {return a < b ? a : b;}

ll max(ll a, ll b) {return a > b ? a : b;}
ll max(int a, ll b) {return a > b ? a : b;}
ll max(ll a, int b) {return a > b ? a : b;}
ll max(int a, int b) {return a > b ? a : b;}

namespace MySpace{

};

#define F(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define fi first
#define se second
#define re return
#define all(x) (x).begin(), (x).end()

double PI = acos(-1);
int n;
struct Point{
    double x, y;
    int id;
};
Point pnt[500];
double ar[500];

double g(Point a, Point b, Point c)
{
    double al = atan2(a.y - b.y, a.x - b.x);
    double be = atan2(c.y - b.y, c.x - b.x);
    //printf("%.9f\n%.9f\n", al, be);
    double r = al - be;
    while (r < 0) r += 2 * PI;
    if (r > PI) r = 2 * PI - r;
    return PI - r;
}

Point operator - (Point A, Point B)
{
    return Point{A.x - B.x, A.y - B.y};
}

bool under(Point A, Point B, Point C)
{
    Point D = B - A;
    Point E = C - A;
    return E.y * D.x <= D.y * E.x;
}

bool comp(Point A, Point B)
{
    if (A.x == B.x) return A.y < B.y;
    return A.x < B.x;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    if (n == 1)
    {
    	cout << 1;
    	return 0;
    }
    for (int i = 0; i < n; i++)
    {
        cin >> pnt[i].x >> pnt[i].y;
        pnt[i].id = i;
    }
    sort(pnt, pnt + n, comp);
    vector<Point> up, down;
    up.push_back(pnt[0]);
    for (int i = 1; i < n; i++)
    {
        while (up.size() >= 2)
        {
            if (under(up[up.size() - 2], pnt[i], up.back())) up.pop_back();
            else break;
        }
        up.push_back(pnt[i]);
    }
    for (int i = 0; i < n; i++) pnt[i].y *= -1;
    down.push_back(pnt[0]);
    for (int i = 1; i < n; i++)
    {
        while (down.size() >= 2)
        {
            if (under(down[down.size() - 2], pnt[i], down.back())) down.pop_back();
            else break;
        }
        down.push_back(pnt[i]);
    }
    //for (int i = 0; i < up.size(); i++) cout << up[i].id << " "; cout << endl;
    //for (int i = 0; i < down.size(); i++) cout << down[i].id << " "; cout << endl;
    for (int i = 0; i < n; i++) pnt[i].y *= -1;
    for (int i = 0; i < down.size(); i++) down[i].y *= -1;
    reverse(all(down));
    for (int i = 0; i < down.size(); i++)
    {
        up.push_back(down[i]);
    }
    vector<Point> convex;
    for (int i = 0; i < up.size(); i++)
    {
        if (!convex.size() || convex.back().id != up[i].id) convex.push_back(up[i]);
    }
    while (convex.size() && convex.back().id == convex[0].id) convex.pop_back();
    for (int i = 0; i < convex.size(); i++)
    {
        //cout << convex[i].x << " " << convex[i].y << endl;
        ar[convex[i].id] = g(convex[(i - 1 + convex.size()) % convex.size()], convex[i], convex[(i + 1) % convex.size()]);
    }
    double s = 0;
    for (int i = 0; i < n; i++) s += ar[i];
    for (int i = 0; i < n; i++) printf("%.9f\n", ar[i]/s);
}


Measured memory_bytes: 384