#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<complex>
#define rep(i, a, n) for(int i=a;i<n;i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define R long double 
#define P complex<R>
using namespace std;
const int mod = 1000000007;
const int INF = 1e12;
template<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}
template<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}
const R PI = acos(-1.0L);
const R inf = 1e13;
int x[110], y[110];
R ans[110];
inline R dist(int i, P q) {
   P p = P(x[i], y[i]);
   return norm(p - q);
}
signed main(){
    int n;
    cin>>n;
    for (int i=0;i<n;i++)
	{
		cin>>x[i]>>y[i];
    }
    int limit = 200000;
    rep(i, 0, limit){
        R cur = 2.0 * PI / limit * i;
        P point = polar(inf, cur);
        R d = 1e130;
        int idx = -1;
        rep(j, 0, n) if(chmin(d, dist(j, point))) idx = j;
        ans[idx] += 1.0;
    }
    cout.precision(20);
	rep(i, 0, n) cout << fixed << 1.0 * ans[i] / limit << endl;
	return 0;
}


#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
#include <queue>
using namespace std;


int main(){
    long long n;
    cin >> n;
    vector<vector<long long> > a(n + 1, vector<long long>(n));
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j < n; ++j){
            cin >> a[i][j];
        }
    }
    vector<long long> round;
    vector<long long> cnt(n + 1, 1);
    for(int i = 1; i <= n; ++i){
        if(a[a[i][1]][1] == i){
            round.push_back(i);
        }
    }
    long long ans = 0;
    while(!round.empty()){
        ans++;
        vector<long long> nw;
        for(long long i: round){
            cnt[i]++;
            if(cnt[i] <= n - 1){
                long long x = a[i][cnt[i]];
                if(i == a[x][cnt[x]]){
                    nw.push_back(i);
                    nw.push_back(x);
                }
            }
        }
        round = nw;
    }
    for(int i = 1; i <= n; ++i){
        if(cnt[i] != n){
            cout << -1;
            return 0;
        }
    }
    cout << ans;
}