#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#include <algorithm>
#include <queue>
#include <bitset>
using namespace std;
const int N = 1e5 +9 ;
typedef long long ll;
int read() {
  int x = 0, s = 1; char ch = getchar();
  for (; !isdigit(ch); ch = getchar()) if (ch == '-') s = -1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + (ch ^ 48);
  return x * s; 
}

int n;
double a[N];

int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  double sum = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    sum += a[i];
  }
  // for (int j = 0; j < 1000; ++j) {
  //   for (int i = 1; i <= n; ++i) {
  //     a[(i % n) + 1] += a[i] / 2;
  //     a[i] /= 2;
  //   }
  // }
  cout << sum / (n + 1) * 2 << ' ';
  for (int i = 2; i <= n; ++i) {
    cout << sum / (n + 1) << ' ';
  }
  cout << '\n';
  return 0;
}