#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define mkpii make_pair<int, int>
#define pdi pair<double, int>
#define mkpdi make_pair<double, int>
#define pli pair<ll, int>
#define mkpli make_pair<ll, int>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define for1(i,a,n) for(int i=(a);i<=(n);++i)
#define for2(i,a,n) for(int i=(a);i<(n);++i)
#define for3(i,a,n) for(int i=(a);i>=(n);--i)
#define for4(i,a,n) for(int i=(a);i>(n);--i)
#define CC(i,a) memset(i,a,sizeof(i))
#define read(a) a=getint()
#define print(a) printf("%d", a)
#define dbg(x) cout << (#x) << " = " << (x) << endl
#define error(x) (!(x)?puts("error"):0)
#define printarr2(a, b, c) for1(_, 1, b) { for1(__, 1, c) cout << a[_][__]; cout << endl; }
#define printarr1(a, b) for1(_, 1, b) cout << a[_] << '\t'; cout << endl
inline const int getint() { int r=0, k=1; char c=getchar(); for(; c<'0'||c>'9'; c=getchar()) if(c=='-') k=-1; for(; c>='0'&&c<='9'; c=getchar()) r=r*10+c-'0'; return k*r; }
inline const int max(const int &a, const int &b) { return a>b?a:b; }
inline const int min(const int &a, const int &b) { return a<b?a:b; }struct cp {double r, i;cp(long double _r=0.0, double _i=0.0) : r(_r), i(_i) { }cp operator+ (const cp &x) { return cp(r + x.r, i + x.i); }cp operator- (const cp &x) { return cp(r - x.r, i - x.i); }cp operator* (const cp &x) { return cp(r*x.r - i*x.i, r*x.i + i*x.r); }
};
const int N=400005;
const double PI=acos(-1.0);
cp A[N];
int rev[N];
void dft(cp *a, int n, int flag) {rep(i, n) A[rev[i]]=a[i];rep(i, n) a[i]=A[i];for(int m=2; m<=n; m<<=1) {cp wn(cos(2.0*PI/m*flag), sin(2.0*PI/m*flag));for(int i=0; i<n; i+=m) {cp w(1.0); int mid=(m>>1);for(int j=0; j<mid; ++j) {cp u=a[i+j+mid]*w, t=a[i+j];a[i+j]=t+u;a[i+j+mid]=t-u;w=w*wn;}}}if(flag==-1) rep(i, n) a[i].r/=n;
}
void init(int &len) {int k=1, l=0;while(k<len) k<<=1, ++l;len=k;rep(i, len) {int t=i, r=0; k=l;while(k--) r<<=1, r|=(t&1), t>>=1;rev[i]=r;}
}
void fft(double *x, double *y, cp *a, cp *b, cp *c, int len) {rep(i, len) a[i].r=x[i], a[i].i=0.0; //虚数不初始化就是作死rep(i, len) b[i].r=y[i], b[i].i=0.0;dft(a, len, 1); dft(b, len, 1);rep(i, len) c[i]=a[i]*b[i];dft(c, len, -1);
}
int n, len;
double g[N], f[N], ff[N], ans[N];
cp a[N], b[N];
int main() {read(n); len=n*2+1;init(len);for1(i, 1, n) scanf("%lf", &f[i]);for1(i, 1, n) g[i]=1.0/i/i;for1(i, 0, n) ff[i]=f[n-i];fft(f, g, a, b, a, len);for1(i, 1, n) ans[i]=a[i].r;fft(ff, g, a, b, a, len);for1(i, 1, n) ans[i]-=a[n-i].r;for1(i, 1, n) printf("%.3f\n", ans[i]);return 0;
}