//
// Created by Tetsuya Shiota on 2019-04-13.
//

#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#define REP(i, b, n) for (Int i = b; i < Int(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(e, o) for (auto &&e : o)
#ifdef LOCAL
#define pp(x) cerr << __LINE__ << ' ' << #x << " = " << (x) << endl
#define dump(x)                                                                \
  cerr << __LINE__ << ' ' << #x << " : ";                                      \
  FOR(e, x) cerr << e << ' ';                                                  \
  cerr << endl;
#else
#define pp(x)
#define dump(x)
#endif

using namespace std;

using Int = long long;
using vi = vector<Int>;
using vvi = vector<vi>;
using pii = pair<Int, Int>;

const Int dy[] = {-1, 0, 1, 0};
const Int dx[] = {0, 1, 0, -1};

template <typename T> void reverse(vector<T> &v) {
  reverse(v.begin(), v.end());
}
template <typename T> void sort(vector<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void rsort(vector<T> &v) { sort(v.rbegin(), v.rend()); }
template <typename T> T sum(const vector<T> &v) {
  return accumulate(v.begin(), v.end(), T(0));
}
template <class T> void update_max(T &a, const T &b) { a = max(a, b); }
template <class T> void update_min(T &a, const T &b) { a = min(a, b); }
vector<pair<char, Int>> merge_cont_char(const string &s) {
  vector<pair<char, Int>> ret;
  if (s.empty())
    return ret;
  ret.push_back(make_pair(s[0], 0));
  FOR(c, s) {
    if (ret.back().first == c)
      ret.back().second++;
    else
      ret.push_back(make_pair(c, 1));
  }
  return ret;
}

class Shakutori {
public:
  // 全体の範囲
  // [0, end)
  // 注目している範囲
  // [tail, head)
  Int head, tail, end = 0;
  bool moveHead() {
    if (head == end) {
      return false;
    }
    head++;
    return true;
  }
  void moveTail() { tail++; }
  bool valid() {
    if (head == tail)
      return true;
    // [tail, head)
    // が解として適当か検証する
    return true;
  }
  void solve() {
    head = tail = 0;
    Int ans = 0;
    while (moveHead()) {
      while (!valid()) {
        moveTail();
      }
      // ここで解を更新する
    }
  }
};

const long double EPS = (long double)(1E-16);

typedef vector<long double> Vector;
typedef vector<Vector> Matrix;

Vector gauss_jordan(const Matrix &A, const Vector &b){
  Int n = A.size();
  Matrix B(n, Vector(n+1));
  rep(i, n){
    rep(j, n){
      B[i][j] = A[i][j];
    }
  }

  rep(i, n){
    B[i][n] = b[i];
  }

  rep(i, n){
    Int pivot = i;
    REP(j, i, n){
      if(abs(B[j][i]) > abs(B[pivot][i])){
        pivot = j;
      }
    }

    swap(B[i], B[pivot]);

    if(abs(B[i][i]) < EPS)return Vector();

    REP(j, i+1, n+1)B[i][j] /= B[i][i];
    rep(j, n){
      if(i != j){
        REP(k, i+1, n+1){
          B[j][k] -= B[j][i] * B[i][k];
        }
      }
    }
  }

  Vector x(n);
  rep(i, n)x[i] = B[i][n];
  return x;
}

class Solver {
public:
  vi ans;
  Int N;
  vi D;
  Solver() {}
  void input() {
    cin >> N;
    D = vi(N);
    rep(i, N)cin >> D[i];
  }
  void solve() {
    Int tmp = 0;
    rep(i, N){
      if(i % 2 == 0){
        tmp += D[i] * 2;
      }else{
        tmp -= D[i] * 2;
      }
    }
    ans.push_back(tmp/2);

    REP(i, 1, N){
      ans.push_back((D[i-1] - ans.back()/2)*2);
    }
  }
  void output() {
    rep(i, N){
      if(i)cout <<' ';
      cout << ans[i];
    }
    cout << endl;
  }
};

void initilization() {
  struct BoolName : numpunct<char> {
    string t, f;
    BoolName(string t = "Yes", string f = "No") : t(t), f(f) {}
    string do_truename() const { return t; }
    string do_falsename() const { return f; }
  };
  cin.tie(nullptr);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(15) << boolalpha;
  cout.imbue(locale(cout.getloc(), new BoolName));
}

int main() {
  initilization();
#ifdef LOCAL
  while (1) {
    Solver s;
    s.input();
    if (cin.eof())
      break;
    s.solve();
    s.output();
  }
#else
  Solver s;
  s.input();
  s.solve();
  s.output();
#endif
  return 0;
}


Measured memory_bytes: 3060