#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > struct getv_fmt;
template <> struct getv_fmt<       int >{ static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

#include <complex>
using Point =  complex< double >;
constexpr double EPS = 1e-15;
constexpr double PI = acos( -1 );
constexpr Point O( 0, 0 );

// 入力ストリームから実数二つをとって Point へ
istream& operator>> ( istream &s, Point &a )
{
	double r, i;
	s >> r >> i;
	a = Point( r, i );
	return s;
}

// a == b
bool eq( const double a, const double b )
{
	return abs( a - b ) <= EPS;
}

// 内積（ドット積）
double dot( const Point &a, const Point &b )
{
	return a.real() * b.real() + a.imag() * b.imag();
}

// 外積（クロス積）
double cross( const Point &a, const Point &b )
{
	return a.real() * b.imag() - a.imag() * b.real();
}

// x 座標優先
// include : eq
struct CompX : public binary_function<Point,Point,bool>
{
	bool operator ()( const Point &a, const Point &b ) const
	{
		return eq( a.real(), b.real() ) ? a.imag() < b.imag() : a.real() < b.real();
	}
};

// 点集合 ps の凸包（ Graham Scan ）
// include : cross, CompX
vector<Point> convex_hull( vector<Point> ps )
{
	const int N = ps.size();

	sort( ps.begin(), ps.end(), CompX() );

	int k = 0;
	vector<Point> convex( N * 2 );

	for ( int i = 0; i < N; i++ )
	{
		while ( 2 <= k && cross( convex[ k - 1 ] - convex[ k - 2 ], ps[i] - convex[ k - 1 ] ) <= EPS )
		{
			k--;
		}
		convex[ k++ ] = ps[i];
	}

	for ( int i = N - 2, t = k; 0 <= i; i-- )
	{
		while ( t < k && cross( convex[ k - 1 ] - convex[ k - 2 ], ps[i] - convex[ k - 1 ] ) <= EPS )
		{
			k--;
		}
		convex[ k++ ] = ps[i];
	}

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

// 法線ベクトル
Point normalVector1( const Point &a )
{
	return a * Point( 0, 1 );
}
Point normalVector2( const Point &a )
{
	return a * Point( 0, -1 );
}
int point_index( const VT< Point > &ps, const Point &q )
{
	REP( i, SZ( ps ) )
	{
		if ( abs( ps[i] - q ) <= EPS )
		{
			return i;
		}
	}

	assert( false );

	return -1;
}

// CCW 関数　a -> b -> c と進むとき、反時計回りなら 1, 直進なら 0, 時計回りなら -1
// include : dot, cross
// -1, 1 := 外積の符号
//  2 := c-a-b で一直線
// -2 := a-b-c で一直線
//  0 := a-c-b で一直線
int ccw( const Point &a, const Point &b, const Point &c )
{
	if ( cross( b - a, c - a ) < -EPS )
	{
		return -1;
	}
	if ( EPS < cross( b - a, c - a ) )
	{
		return 1;
	}
	if ( dot( b - a, c - a ) < -EPS )
	{
		return 2;
	}
	if ( dot( b - a, b - a ) < dot( c - a, c - a ) )
	{
		return -2;
	}	
	return 0;
}

void case_liner( const VT< Point > &ps )
{
	const int N = SZ( ps );

	REP( i, 2, N )
	{
		if ( abs( ccw( ps[0], ps[1], ps[i] ) ) == 1 )
		{
			return;
		}
	}

	VI indices( N );
	iota( ALL( indices ), 0 );
	{
		CompX comp;
		sort( ALL( indices ), [&]( const int i, const int j ){ return comp( ps[i], ps[j] ); } );
	}


	VT< double > res( N );
	res[ indices[0] ] = res[ indices.back() ] = 0.5;
	

	copy( ALL( res ), ostream_iterator< double >( cout, "\n" ) );
	cout << flush;

	exit( 0 );

	return;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N );

	if ( N == 2 )
	{
		cout << 0.5 << endl;
		cout << 0.5 << endl;
		return 0;
	}


	VT< Point > ps( N );
	cin >> ps;

	case_liner( ps );

	const auto convex = convex_hull( ps );
	const int M = SZ( convex );

	VT< double > res( N );
	REP( i, M )
	{
		const auto norm1 = normalVector1( convex[             i ] - convex[ ( i + 1 ) % M ] );
		const auto norm2 = normalVector2( convex[ ( i + 2 ) % M ] - convex[ ( i + 1 ) % M ] );
		const double theta =  arg( norm2 / norm1 );

		res[ point_index( ps, convex[ ( i + 1 ) % M ] ) ] = ( theta ) / ( 2 * PI );
	}

	copy( ALL( res ), ostream_iterator< double >( cout, "\n" ) );
	cout << flush;

	return 0;
}


Measured memory_bytes: 256