#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>

#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair

using namespace std;

ll binpow(ll a, ll b , int mod) {
    ll res = 1;
    res %= mod;
    while(b > 0) {
        if(b & 1){
            res = res * a;
            res %= mod;
        }
        a = a * a;
        a %= mod;
        b >>= 1;
    }
    return res;
}

int main(){
    int n , i;
    cin >> n;
    long double a;
    long double b[n];
    long double sum = 0 ;
    for(i = 0 ; i < n ; i ++){
        cin >> a;
        sum += a;
    }
    long double k = sum * 1.0 / (n + 1);
    int uld = binpow(2012 , 1204 , n);
    for(i = 0 ; i < n ; i++){
        cout << fixed;
        if(i == uld) printf("%6Lf " , k * 2.0);
        else printf("%6Lf " , k);
    }
}