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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;
using ld = long double;

struct point2d{
  ld x, y;
  point2d(){}
  point2d(ld x, ld y): x(x), y(y){}
  point2d operator+(const point2d &r) const{
    return point2d(x + r.x, y + r.y);
  }
  point2d operator-(const point2d &r) const{
    return point2d(x - r.x, y - r.y);
  }
  point2d& operator+=(const point2d &r){
    *this = *this + r;
    return *this;
  }
  point2d& operator-=(const point2d &r){
    *this = *this - r;
    return *this;
  }
  bool operator==(const point2d &r) const{
    return abs(x - r.x) < EPS && abs(y - r.y) < EPS;
  }
  bool operator!=(const point2d &r) const{
    return !(*this == r);
  }
  bool operator<(const point2d &r) const{
    if(abs(x - r.x) >= EPS)return x < r.x;
    return y < r.y;
  }
};

point2d operator*(ld x, const point2d &p){
  return point2d(x * p.x, x * p.y);
}

point2d operator/(const point2d &p, ld x){
  return point2d(p.x / x, p.y / x);
}

ld norm(const point2d &a){
  return sqrt(a.x * a.x + a.y * a.y);
}

ld dis(const point2d &a, const point2d &b){
  point2d c = a - b;
  return norm(c);
}

ld inner_product(const point2d &a, const point2d &b){
  return a.x * b.x + a.y * b.y;
}

ld outer_product(const point2d &a, const point2d &b){
  return a.x * b.y - a.y * b.x;
}

ld cosine(const point2d &a, const point2d &b){
  return inner_product(a, b) / norm(a) / norm(b);
}

ld cross(const point2d &o, const point2d &a, const point2d &b){
  return outer_product(a - o, b - o);
}

vector<point2d> convex_hull(vector<point2d> vec){
  int n = vec.size(), k = 0;
  if(n < 3)return vec;

  vector<point2d> ch(2 * n);
  sort(vec.begin(), vec.end());

  // lower
  for(int i = 0; i < n; i++){
    while(k >= 2 && cross(ch[k-2], ch[k-1], vec[i]) <= 0.)k--;
    ch[k++] = vec[i];
  }

  // upper
  for(int i = n - 1, t = k + 1; i > 0; i--){
    while(k >= t && cross(ch[k-2], ch[k-1], vec[i-1]) <= 0.)k--;
    ch[k++] = vec[i-1];
  }

  ch.resize(k-1);
  return ch;
}


int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<ll> x(n), y(n); rep(i, n)cin >> x[i] >> y[i];
  vector<ld> res(n, 0);
  // on line
  bool line = true;
  rep(i, n){
    FOR(j, i + 1, n){
      rep(k, n){
        ll a1 = x[k] - x[j], b1 = y[k] - y[j];
        ll a2 = x[j] - x[i], b2 = y[j] - y[i];
        if(a1 * b2 - a2 * b1 != 0)line = false;
      }
    }
  }
  if(line){
    vector<ll> xt = x; sort(whole(xt)); unique(xt);
    if(sz(xt) == 1){
      ll maxi = - inf, mini = inf;
      int maxidx = 0, minidx = 0;
      rep(i, n){
        if(chmax(maxi, y[i]))maxidx = i;
        if(chmin(mini, y[i]))minidx = i;
      }
      res[maxidx] = res[minidx] = 0.5;
    }else{
      ll maxi = - inf, mini = inf;
      int maxidx = 0, minidx = 0;
      rep(i, n){
        if(chmax(maxi, x[i]))maxidx = i;
        if(chmin(mini, x[i]))minidx = i;
      }
      res[maxidx] = res[minidx] = 0.5;
    }
  }else{
    vector<point2d> v(n); rep(i, n)v[i] = point2d(x[i], y[i]);
    map<pair<ll, ll>, int> mp;
    rep(i, n)mp[mk(x[i], y[i])] = i;
    auto cv = convex_hull(v);
    vector<point2d> vp; vp.pb(cv.back());
    for(auto c: cv)vp.pb(c);
    vp.pb(cv[0]);
    ld pi = acosl(-1.);
    for(int i = 1; i < sz(vp) - 1; i++){
      int idx = mp[mk((ll)vp[i].x, (ll)vp[i].y)];
      ld theta1 = atan2l(vp[i].x - vp[i+1].x, - vp[i].y + vp[i+1].y);
      ld theta2 = atan2l(vp[i-1].x - vp[i].x, - vp[i-1].y + vp[i].y);
      //cerr << vp[i].x << " " << vp[i].y << " " << theta1 << " " << theta2 << endl;
      //cerr << vp[i].x << " " << vp[i].y << " " << theta1 << " " << theta2 << endl;
      if(theta1 < theta2)theta1 += 2. * pi;
      res[idx] = (theta1 - theta2) / (2. * pi);
    }
  }

  rep(i, n){
    cout << res[i] << endl;
  }
  return 0;
}


Measured memory_bytes: 256