#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll n;std::cin >> n;
  vll b(n);get(b);
  ll t = b[0];
  re(i, n) b[i] *= (n-1);
  vll ans(n, 0);
  ll S = 0;
  re(i, n) {
    ans[i] = b[0] - b[i];
    S += ans[i];
  }
  for(ll i=-100000000;i<=100000000;i++){
    ll num = S + i * (n-1);
    if(num%(n-1)==0&&num/(n-1)==t){
      for(int j=0;j<n;j++) std::cout << ans[j] + i << (j==n-1?"\n":" ");
      return 0;
    }
  }

}