#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define reach(i,a)	for(auto i:a)
#define rep(i,n)	for(int i=0;i<(int)n;i++)
#define REP(i,n)	for(int i=0;i<=(int)n;i++)
#define srep(i,a,n)	for(int i=a;i<(int)n;i++)
#define SREP(i,a,n)	for(int i=a;i<=(int)n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define pb	push_back
#define fst	first
#define scn second
int bitcnt(ll x) {
	x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
	x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
	x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
	x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
	x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
	x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
	return x;
}
int bitcnt(int x) {
	x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
	x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
	x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
	x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
	x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
	return x;
}
ll gcd(ll a, ll b) {
	return a%b == 0 ? b : gcd(b, a%b);
}
#define debug(x)	cout<<"case #" << x << ": " << endl
#define DEBUG 0
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const ld eps = 1e-8;
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };

struct P {
	ld x, y;
	P() {}
	P(ld x, ld y) :x(x), y(y) {}
	P operator +(P & p) {
		return P(x + p.x + eps, y + p.y + eps);
	}
	P operator -(P & p) {
		return P(x - p.x + eps, y - p.y + eps);
	}
	P operator *(ld a) {
		return P(a*x, a*y);
	}
	P & operator +=(const P & p) {
		x += p.x;	y += p.y;	return *this;
	}
	P & operator -=(const P & p) {
		x -= p.x;	y -= p.y;	return *this;
	}
	P & operator *=(ld a) {
		x *= a;	y *= a;	return *this;
	}
	bool operator ==(P & p) {
		return (x == p.x)&&(y == p.y);
	}
	bool operator !=(P & p) {
		return (x != p.x) || (y != p.y);
	}
	bool operator <(P & p) {
		return (x == p.x ? y < p.y : x < p.x);
	}
	bool operator <=(P & p) {
		return (x == p.x ? y <= p.y : x <= p.x);
	}
	bool operator >(P & p) {
		return (x == p.x ? y > p.y : x > p.x);
	}
	bool operator >=(P & p) {
		return (x == p.x ? y >= p.y : x >= p.x);
	}
	ld dot(P p) {
		return x*p.x + y*p.y;
	}
	ld det(P p) {
		return x*p.y - y*p.x;
	}
	ld len() {
		return sqrtl(x*x + y*y);
	}
	ld getArg() {
		return arg(complex<ld>(x, y));
	}
};

vector<P> convex_hull(vector<P> ps, int n) {
	sort(all(ps));
	int k = 0;
	vector<P> qs(n * 2);
	for (int i = 0; i < n; i++) {
		while (k > 1 && (qs[k - 1] - qs[k - 2]).det(ps[i] - qs[k - 1]) <= 0)	k--;
		qs[k++] = ps[i];
	}
	for (int i = n - 2, t = k; i >= 0; i--) {
		while (k > t && (qs[k - 1] - qs[k - 2]).det(ps[i] - qs[k - 1]) <= 0)	k--;
		qs[k++] = ps[i];
	}
	qs.resize(k - 1);
	return qs;
}

int main() {
	int n;	cin >> n;
	vector<P> p(n);
	rep(i, n)	cin >> p[i].x >> p[i].y;
	vector<P> dat = convex_hull(p, n);
	int l = dat.size();
	rep(i, l)	dat.push_back(dat[i]);
	vector<ld> ret(n);
	rep(i, n) {
		srep(j, 1, dat.size()) {
			if (p[i] == dat[j]) {
				P a = dat[j + 1] - dat[j];
				P b = dat[j] - dat[j - 1];
				ld arg = a.getArg() - b.getArg();
				if (arg < 0)	arg += 2 * M_PI;
				ret[i] = arg / (2 * M_PI);
				break;
			}
		}
	}
	rep(i, n)	printf("%.15Lf\n", ret[i]+eps);
}

Measured memory_bytes: 384