#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;

signed main(){
    int n;
    cin >> n;
    int sum = 0;
    int y[n];
    REP(i,n){
        cin >> y[i];
        sum += y[i];
    }
    REP(i,n){
        cout << sum - (n - 1) * y[i];
        if(i != n - 1) cout << " ";
    }
    cout << endl;
    return 0;
}