#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ldb = long double;
struct point {
    ldb x, y;
    point operator+(const point& o) const { return {x + o.x, y + o.y}; }
    point operator-(const point& o) const { return {x - o.x, y - o.y}; }
    point operator*(const ldb& o) const { return {x * o, y * o}; }

    ldb operator^(const point& o) const { return x * o.y - o.x * y; }
    ldb operator*(const point& o) const { return x * o.x + o.y * y; }
};
struct seg {
    point a, b;
    void norm() {
        if ((a ^ b) < 0) swap(a, b);
    }
};

point fs(const point& a, const point& b, const point& p) {
    auto v = b - a;
    auto q = a + v * ((p - a) * v / (v * v));
    return q * 2 - p;
}

seg fs(const seg& a, const seg& p) {
    auto p1 = fs(a.a, a.b, p.a);
    auto p2 = fs(a.a, a.b, p.b);
    auto ans = seg{p1, p2};
    ans.norm();
    return ans;
}

point inter(const point& p, const seg& a) {
    auto v = a.a - a.b;
    auto v1 = p ^ v;
    auto v2 = (a.b ^ v);
    return p * (v2 / v1);
}
const ldb eps = 1e-12;
bool in(const seg& a, const point& b) {
    // if (a.a * b < eps || a.b * b < eps) return 0;

    ldb p1 = (a.a ^ b);
    ldb p2 = (a.b ^ b);
    if (abs(p1) <= eps || abs(p2) <= eps) return 1;
    return (p1 > eps) && (p2 < -eps);
}

void cmx(ldb& a, ldb b) {
    a = max(a, b);
}
int main() {
    int n;
    cin >> n;
    vector<point> a(n);
    vector<ldb> ans(n + 10);
    for (int i = 0; i < n; ++i) cin >> a[i].x >> a[i].y;
    for (int i = 0; i < n; ++i) {
        auto p = a[i];
        for (auto& u : a) u = u - p;
        vector<seg> s(n);
        for (int i = 0; i < n; ++i) s[i] = {a[i], a[i == n - 1 ? 0 : i + 1]}, s[i].norm();
        for (int j = 0; j < n; ++j) {
            vector<int> vis(n);
            seg range = s[j];
            vector<seg> stk;
            vis[j] = 1;
            stk.push_back(s[j]);
            auto dfs = [&](auto self, seg rng) -> void {
                cmx(ans[stk.size()], rng.a * rng.a);
                cmx(ans[stk.size()], rng.b * rng.b);
                if (stk.size() == n + 1) return;
                for (int i = 0; i < n; ++i) {
                    if (stk.size() != n && vis[i]) continue;
                    seg tmp = s[i];
                    for (const auto& u : stk) tmp = fs(u, tmp);
                    seg nrng;
                    nrng.a = in(rng, tmp.a) ? tmp.a : inter(rng.a, tmp);
                    nrng.b = in(rng, tmp.b) ? tmp.b : inter(rng.b, tmp);
                    if (!in(tmp, nrng.a) || !in(tmp, nrng.b)) continue;
                    stk.push_back(tmp);
                    vis[i] = 1;
                    self(self, nrng);
                    stk.pop_back();
                    vis[i] = 0;
                }
            };
            dfs(dfs, range);
        }
    }
    for (int i = 1; i <= n + 1; ++i) printf("%.20LF\n", sqrtl(ans[i]));
}
/*
3
4 0
0 3
0 2

3
4 0
0 3
0 2

3
4 0
0 3
0 -1

3
-67 22
-86 12
-81 -12

3
14 34
-5 24
0 0

3
4 0
0 3
0 2
*/