#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll mod;

ll binpow(ll a, ll n) {
    ll ans=1;
    while (n) {
        if (n%2==1) ans=(ans*a)%mod;
        a=(a*a)%mod;
        n/=2;
    }
    return ans;
}

int main() {
    int n; cin>>n;
    mod=n;
    double sum=0,a[n+5];
    for (int i=0; i<n; ++i) cin>>a[i], sum+=a[i];

    int x=binpow(2022,1204);

    for (int i=0; i<n; ++i) {
        if (i==x) cout<<fixed<<setprecision(8)<<sum*2/(n+1)<<" ";
        else cout<<fixed<<setprecision(8)<<sum/(n+1)<<" ";
    }
}