#include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <string>
#include <random>
#include <utility>
#include <cmath>
#include <string.h>
#include <iomanip>
#include <stdlib.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int,int> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部０にする
 

int n;
int i,j;
double x,y;
double a[101],b[101];
int cou[101];
double kyo;
double ima;
int look;
double ookii;

int main(){
	cin>>n;
	memset(cou,0,sizeof(cou));
	for(i=0;i<n;i++){
		cin>>x>>y;
		a[i]=x*1.000/10;
		b[i]=y*1.000/10;
		ookii=max(ookii,max(x,y));
	}
	double xx,yy;
	for(i=0;i<1000000;i++){
		ima = INF;
		xx=ookii * 1000000 *sin(i*7.000000/Pi);
		yy=ookii * 1000000 *cos(i*7.000000/Pi);
		for(j=0;j<n;j++){
			kyo  =-a[j]*xx - b[j] * yy ;
			if(kyo<ima){
				ima = kyo;
				look = j;
			}
		}
		cou[look] += 1;

	}
	for(i=0;i<n;i++){
		cout<< fixed << setprecision(15) <<(double)cou[i]*1.00000000/1000000<<endl;
	}
	return 0;
}
