#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;

    int y[n];
    rep(i,n)cin >> y[i];

    int sum = 0;
    rep(i,n)sum += y[i];

    rep(i,n){
        cout << sum - y[i] * (n - 1);
        if(i == n - 1)cout << endl;
        else cout << ' ';
    }
    return 0;
}