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

using P = pair<int,int>;
using PP = pair<P, P>;
using ll = long long int;
constexpr int INF = 1<<30;
constexpr ll MOD = (1e9)+7;

int main(){
    ll n, sum = 0;
    cin >> n;
    vector<ll> y(n);
    for(int i=0;i<n;i++){
        cin >> y[i];
        y[i] *= n-1;
        sum += y[i];
    }
    sum /= n-1;
    for(int i=0;i<n;i++){
        cout << sum-y[i] << " \n"[i==n-1];
    }
    return 0;
}