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

typedef long double ld;
typedef long long ll;
const ld pi=acos(-1.0);

int n;
struct vec{
	ll x,y;
	vec(){}
	vec(ll a,ll b){x=a;y=b;}
	vec operator+(vec v){return vec(x+v.x,y+v.y);}
	vec operator-(vec v){return vec(x-v.x,y-v.y);}
	vec operator-(){return vec(-x,-y);}
	ll operator*(vec v){return x*v.y-v.x*y;}
	inline ld arg(){return atan2(y,x);}
	inline friend bool operator<(vec a,vec b){
		return a.arg()<b.arg(); 
	}
}p[105],q[105];

inline void init(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
		scanf("%lld%lld",&p[i].x,&p[i].y);
}

inline void solve(){
	for(int i=1;i<=n;++i){
		for(int j=1,k=0;j<=n;++j){
			if(i==j)continue;
			q[++k]=p[j]-p[i];
		}
		sort(q+1,q+n);
		ld arg=0;
		for(int i=1;i<n-1;++i)
			arg=max(arg,q[i+1].arg()-q[i].arg());
		arg=max(arg,q[1].arg()+2*pi-q[n-1].arg());
		arg=arg<pi?0:arg-pi;
		printf("%.6lf\n",double(arg/pi/2));
	}
}

int main(){
	init();
	solve();
	return 0;
} 