#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#include <climits>
#include <random>

#define _overload(a, b, c, d, ...) d
#define _rep1(X, A, Y) for (int (X) = (A);(X) <= (Y);++(X))
#define _rep2(X, Y) for (int (X) = 0;(X) < (Y);++(X))
#define rep(...) _overload(__VA_ARGS__, _rep1, _rep2)(__VA_ARGS__)
#define rrep(X,Y) for (int (X) = Y-1;(X) >= 0;--(X))
#define all(X) (X).begin(),(X).end()
#define len(X) ((int)(X).size())
#define mod(n, m) (((n)%(m)+(m))%m)
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
const int INFINT = 1 << 30;                          // 1.07x10^ 9
const ll INFLL = 1LL << 60;                          // 1.15x10^18
const double EPS = 1e-10;
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

const int MAX_N = 100;
ll N;
ll x[MAX_N], y[MAX_N];

struct vertex { ll x, y, n; };

int check(vertex& v1, vertex& v2, vertex& v3) {
    Pll vec1(v2.x-v1.x, v2.y-v1.y);
    Pll vec2(v3.x-v1.x, v3.y-v1.y);

    ll rot = vec1.fi*vec2.sc - vec1.sc*vec2.fi;

    if (rot > 0) {
        return 1;
    } else if (rot < 0) {
        return -1;
    } else {
        return 0;
    }
}

vector<int> conv(vector<vertex> vertexs) {
    vector<int> res;
    vector<int> tmp;
    for (int i = 0; i < 2; ++i) res.push_back(i);
    for (int i = 2; i < len(vertexs); ++i) {
        for (int j = len(res)-1; j > 0; --j) {
            if (check(vertexs[i], vertexs[res[j]], vertexs[res[j-1]]) < 0) {
                for (int k = 0; k <= j; ++k) {
                    tmp.push_back(res[k]);
                }
                tmp.push_back(i);
                res = tmp;
                tmp.clear();
                break;
            }
            if (j == 1) {
                res.clear();
                res.push_back(0);
                res.push_back(i);
            }
        }
    }


    vector<int> res2;
    for (int i = len(vertexs)-1; i > len(vertexs)-3; --i) res2.push_back(i);
    for (int i = len(vertexs)-3; i >= 0; --i) {
        for (int j = len(res2)-1; j > 0; --j) {
            if (check(vertexs[i], vertexs[res2[j]], vertexs[res2[j-1]]) < 0) {
                for (int k = 0; k <= j; ++k) {
                    tmp.push_back(res2[k]);
                }
                tmp.push_back(i);
                res2 = tmp;
                tmp.clear();
                break;
            }
            if (j == 1) {
                res2.clear();
                res2.push_back(len(vertexs)-1);
                res2.push_back(i);
            }
        }
    }

    for (int i = 1; i < len(res2); ++i) {
        res.push_back(res2[i]);
    }

    return res;
}

double calc_arg(vertex& v1, vertex& v2, vertex& v3) {
    complex<double> comp1(v2.x-v1.x, v2.y-v1.y);
    complex<double> comp2(v3.x-v1.x, v3.y-v1.y);
    comp2 /= comp1;
    return arg(comp2) * 180.0 / M_PI;
}

int main() {
  std::ios::sync_with_stdio(false);std::cin.tie(0);

  cin >> N;
  rep(i, N) cin >> x[i] >> y[i];

  if (N == 2) {
      rep(i, 2) printf("%.10lf\n", 0.5);
      return 0;
  }


  vector<vertex> vertexs;
  for (int i = 0; i < N; ++i) {
      vertexs.push_back((vertex){x[i], y[i], i});
  }

  auto comp = [] (const vertex& v1, const vertex& v2) {
      if (v1.x != v2.x) {
          return v1.x < v2.x;
      } else {
          return v1.y < v2.y;
      }
  };
  
  sort(all(vertexs), comp);

  vector<int> convs = conv(vertexs);

  vector<double> probs;
  double a =  calc_arg(vertexs[convs[0]], vertexs[convs[1]], vertexs[convs[len(convs)-2]]);
  probs.push_back((180.0-a)/360.0);

  for (int i = 1; i < len(convs)-1; ++i) {
      a = calc_arg(vertexs[convs[i]], vertexs[convs[i+1]], vertexs[convs[i-1]]);
      probs.push_back((180.0-a)/360.0);
  }

  vector<double> ans(N);
  for (int i = 0; i < len(probs); ++i) {
      int n = vertexs[convs[i]].n;
      ans[n] = probs[i];
  }

  for (int i = 0; i < N; ++i) {
      printf("%.14lf\n", ans[i]);
  }

  return 0;
}



Measured memory_bytes: 384