#include <cstdio>#include <cmath>#include <algorithm>#define N 1 << 20#define pi acos(-1)using namespace std;struct data{	double x , y;	data() {x = y = 0;}	data(double x0 , double y0) {x = x0 , y = y0;}	data operator+(const data a)const {return data(x + a.x , y + a.y);}	data operator-(const data a)const {return data(x - a.x , y - a.y);}	data operator*(const data a)const {return data(x * a.x - y * a.y , x * a.y + y * a.x);};}a[N] , b[N] , c[N] , d[N];double q[N];void fft(data *a , int n , int flag){	int i , j , k;	for(i = k = 0 ; i < n ; i ++ )	{		if(i > k) swap(a[i] , a[k]);		for(j = (n >> 1) ; (k ^= j) < j ; j >>= 1);	}	for(k = 2 ; k <= n ; k <<= 1)	{		data wn(cos(2 * pi * flag / k) , sin(2 * pi * flag / k));		for(i = 0 ; i < n ; i += k)		{			data t , w(1 , 0);			for(j = i ; j < i + (k >> 1) ; j ++ , w = w * wn)				t = w * a[j + (k >> 1)] , a[j + (k >> 1)] = a[j] - t , a[j] = a[j] + t;		}	}}void work(data *a , data *b , int len){	int i;	fft(a , len , 1) , fft(b , len , 1);	for(i = 0 ; i < len ; i ++ ) a[i] = a[i] * b[i];	fft(a , len , -1);	for(i = 0 ; i < len ; i ++ ) a[i].x /= len;}int main(){	int n , i , len;	scanf("%d" , &n);	for(i = 0 ; i < n ; i ++ )		scanf("%lf" , &q[i]) , a[i].x = c[i].x = q[i] , b[i].x = d[n - i - 1].x = 1.0 / (i + 1) / (i + 1);	for(len = 1 ; len < 2 * n ; len <<= 1);	work(a , b , len) , work(c , d , len);	printf("%lf\n" , -c[n].x);	for(i = 1 ; i < n - 1 ; i ++ ) printf("%lf\n" , a[i - 1].x - c[n + i].x);	printf("%lf\n" , a[n - 2].x);	return 0;}