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

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define ALL(x) x.begin(),x.end()
#define REACH cerr<<"reached line "<<__LINE__<<endl
#define DMP(x) cerr<<"line "<<__LINE__<<" "<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"[";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"]";
	return os;
}

int read(){
	int i;
	#ifdef int
	scanf("%" SCNd64,&i);
	#else
	scanf("%d",&i);
	#endif
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(int x,int suc=1){
	#ifdef int
	printf("%" PRId64,x);
	#else
	printf("%d",x);
	#endif
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

#ifdef int
const int inf=LLONG_MAX/3;
#else
const int inf=INT_MAX/2-100;
#endif

struct Pos{
	int x,y,idx;
	double Dist(){
		return sqrt(x*x+y*y);
	}
};
int cross(Pos a,Pos b){
	return a.x*b.y-a.y*b.x;
}
vector<Pos> CalcConvex(vector<Pos> ps,bool avoid3pts){
	{
		auto itr=min_element(ALL(ps),[&](Pos a,Pos b){
			if(a.x!=b.x)return a.x<b.x;
			else return a.y<b.y;
		});
		swap(*ps.begin(),*itr);
	}
	vector<Pos> convex;
	sort(ps.begin()+1,ps.end(),[&](Pos a,Pos b){
		a.x-=ps[0].x,a.y-=ps[0].y;
		b.x-=ps[0].x,b.y-=ps[0].y;
		int c=cross(a,b);
		if(c)return c>0;
		else if(a.x!=b.x) return a.x<b.x;
		else return a.y<b.y;
	});
	REP(i,ps.size()){
		while(int(convex.size())>=2){
			Pos a=convex[int(convex.size())-2];
			Pos b=convex[int(convex.size())-1];
			Pos c=ps[i];
			a.x-=b.x,a.y-=b.y;
			c.x-=b.x,c.y-=b.y;
			int z=cross(c,a);
			if(z>0||(z==0&&!avoid3pts))break;
			convex.pop_back();
		}
		convex.PB(ps[i]);
	}
	return convex;
}

signed main(){
	int n=read();
	vector<double> ans(n,0);
	vector<Pos> ps(n);
	REP(i,n){
		int x=read(),y=read();
		ps[i]=Pos{x,y,i};
	}
	vector<Pos> convex=CalcConvex(ps,true);
	int s=convex.size();
	//cerr<<s<<endl;
	REP(i,s){
		Pos a=convex[(i+s-1)%s],b=convex[i],c=convex[(i+1)%s];
		a.x-=b.x,a.y-=b.y;
		c.x-=b.x,c.y-=b.y;
		//cerr<<a.x<<" "<<a.y<<endl;
		//cerr<<c.x<<" "<<c.y<<endl;
		double cos=-(a.x*c.x+a.y*c.y)/a.Dist()/c.Dist();
		//cerr<<cos<<endl;
		double theta=acos(max(cos,double(-1)));
		//cerr<<theta<<endl;
		ans[b.idx]=theta/(M_PI*2);
	}
	cout<<fixed<<setprecision(20);
	REP(i,n)
		cout<<ans[i]<<endl;
}


Measured memory_bytes: 256