#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using pii=pair<int,int>;
using ll=long double;
using ld=long double;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

pll add(pll a,pll b)
{
	return {a.x+b.x,a.y+b.y};
}

pll sub(pll a,pll b)
{
	return {a.x-b.x,a.y-b.y};
}

pll mul(ll x,pll a)
{
	return {a.x*x,a.y*x};
}

ll cross(pll a,pll b)
{
	return a.x*b.y-a.y*b.x;
}

ll cross(pll a,pll b,pll c)
{
	return cross(sub(b,a),sub(c,a));
}

ll ccw(pll a,pll b,pll c)
{
	return a.x*(b.y-c.y)+b.x*(c.y-a.y)+c.x*(a.y-b.y);
}

pll perp(pll a)
{
	return {-a.y,a.x};
}

ll dist2(pll a)
{
	return a.x*a.x+a.y*a.y;
}

pll refl(pll a,pll b,pll p)
{
	pll v=sub(b,a);
	return sub(p,mul(2*cross(v,sub(p,a))/dist2(v),perp(v)));
}

pair<int,pll> lineInter(pll s1,pll e1,pll s2,pll e2)
{
	ll d=cross(sub(e1,s1),sub(e2,s2));
	if (d==0) return {-(cross(s1,e1, s2) == 0), pair<ld,ld>(0.L,0.L)};
	ll p = cross(s2,e1, e2), q = cross(s2,e2, s1);
	pll uz=add(mul(p,s1),mul(q,e1));
	return {1,mul(1.L/d,uz)};
}

const ld eps=1e-9;

int sgn(ll x)
{
	return (x>eps)-(x<-eps);
}

bool lineSegInter(pll l1,pll l2,pll s1,pll s2)
{
	return sgn(ccw(s1,l1,l2))*sgn(ccw(s2,l1,l2))<=0;
}

int n;
ld an[N];

void rek(vector<vector<pll>> polys,vi segs)
{
	int sc=segs.size();
	for (int i=0;i<n;++i)
	{
		bool im=0;
		for (int j=0;j<sc;++j) if (segs[j]==i) im=1;
		if (!im)
		{
			pll a=polys.back()[i],b=polys.back()[(i+1)%n];
			vector<pll> nex;
			for (auto x: polys.back()) nex.pb(refl(a,b,x));
			vi nsegs=segs;
			nsegs.pb(i);
			vector<vector<pll>> npoly=polys;
			npoly.pb(nex);
			rek(npoly,nsegs);
		}
	}
	for (int i1=0;i1<=sc;++i1) for (int i2=0;i2<n;++i2) for (int j1=0;j1<=sc;++j1) for (int j2=0;j2<n;++j2)
	{
		pll a=polys[i1][i2],b=polys[j1][j2];
		bool ok=1;
		for (int i=0;i<sc;++i) if (!lineSegInter(a,b,polys[i][segs[i]],polys[i][(segs[i]+1)%n]))
		{
			ok=0;
			break;
		}
		if (ok)
		{
			if (sc==0)
			{
				//cout<<a.x<<' '<<a.y<<' '<<b.x<<' '<<b.y<<en;
			}
			for (int l1=0;l1<n;++l1) if (lineSegInter(a,b,polys[0][l1],polys[0][(l1+1)%n]))
			{
				for (int l2=0;l2<n;++l2) if (lineSegInter(a,b,polys.back()[l2],polys.back()[(l2+1)%n]))
				{
					auto p1=lineInter(a,b,polys[0][l1],polys[0][(l1+1)%n]);
					auto p2=lineInter(a,b,polys.back()[l2],polys.back()[(l2+1)%n]);
					if (p1.x==1 && p2.x==1)
					{
						an[segs.size()]=max(an[segs.size()],dist2(sub(p1.y,p2.y)));
					}
				}
			}
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	vector<pll> poly;
	for (int i=0;i<n;++i)
	{
		ll x,y;
		cin>>x>>y;
		poly.pb({x,y});
	}
	rek({poly},{});
	cout<<fixed<<setprecision(15);
	for (int i=1;i<=n;++i) an[i]=max(an[i],an[i-1]);
	for (int i=0;i<=n;++i) cout<<sqrt(an[i])<<en;
}