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

///////////////////////
// 多角形アルゴリズム
///////////////////////

// 凸包

const double INF = 1LL<<60;      // to be set appropriately
const double EPS = 1e-10;        // to be set appropriately
const double PI = acos(-1.0);
double torad(int deg) {return (double)(deg) * PI / 180;}
double todeg(double ang) {return ang * 180 / PI;}

/* Point */
struct Point {
    double x, y;
    Point(double x = 0.0, double y = 0.0) : x(x), y(y) {}
    friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << ", " << p.y << ')';}
};
inline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}
inline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}
inline Point operator * (const Point &p, double a) {return Point(p.x * a, p.y * a);}
inline Point operator * (double a, const Point &p) {return Point(a * p.x, a * p.y);}
inline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}
inline Point operator / (const Point &p, double a) {return Point(p.x / a, p.y / a);}
inline Point conj(const Point &p) {return Point(p.x, -p.y);}
inline Point rot(const Point &p, double ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}
inline Point rot90(const Point &p) {return Point(-p.y, p.x);}
inline double cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}
inline double dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}
inline double norm(const Point &p) {return dot(p, p);}
inline double abs(const Point &p) {return sqrt(dot(p, p));}
inline double arg(const Point &p) {double res = atan2(p.y, p.x); if (res < 0.0) res += PI*2.0; return res;}
inline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}
inline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}
inline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}
inline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}

/* Line */
struct Line : vector<Point> {
    Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {
        this->push_back(a);
        this->push_back(b);
    }
    friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << ", " << l[1] << '}';}
};

/* Circle */
struct Circle : Point {
    double r;
    Circle(Point p = Point(0.0, 0.0), double r = 0.0) : Point(p), r(r) {}
    friend ostream& operator << (ostream &s, const Circle &c) {return s << '(' << c.x << ", " << c.y << ", " << c.r << ')';}
};

vector<pair<Point, int> > ConvexHull(vector<pair<Point, int>> &ps) {
    int n = (int)ps.size();
    vector<pair<Point, int> > res(2*n);
    sort(ps.begin(), ps.end());
    int k = 0;
    for (int i = 0; i < n; ++i) {
        if (k >= 2) {
            while (cross(res[k-1].first - res[k-2].first, ps[i].first - res[k-2].first) < EPS) {
                --k;
                if (k < 2) break;
            }
        }
        res[k].first = ps[i].first;
        res[k].second = ps[i].second;
        ++k;
    }
    int t = k+1;
    for (int i = n-2; i >= 0; --i) {
        if (k >= t) {
            while (cross(res[k-1].first - res[k-2].first, ps[i].first - res[k-2].first) < EPS) {
                --k;
                if (k < t) break;
            }
        }
        res[k].first = ps[i].first;
        res[k].second = ps[i].second;
        ++k;
    }
    res.resize(k-1);
    return res;
}

int main(int argc, char const *argv[])
{
	int n;
	cin>>n;
	vector<pair<Point,int>> p(n);
	for (int i = 0; i < n; ++i)
	{
		cin>>p[i].first.x>>p[i].first.y;
		p[i].second=i;
	}
	auto con=ConvexHull(p);
	vector<double> ans(n);
	for (int i = 0; i < con.size(); ++i)
	{
		Point p1=rot90(con[(i-1+con.size())%con.size()].first-con[i].first),p2=rot90(con[i].first-con[(i+1)%con.size()].first);
		double tmp=arg(p2)-arg(p1);
		if (tmp<0.0)
		{
			tmp+=2.0*PI;
		}
		ans[con[i].second]=tmp/(2.0*PI);
	}
	for (auto v:ans)
	{
		printf("%.15f\n", v);
	}
	return 0;
}


Measured memory_bytes: 640