#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  unsigned long long n;
  unsigned long long a[100050];
  unsigned long long b[200050];
  scanf("%lld", &n);
  for (int i = 0; i < n / 2; i++) scanf("%lld", &a[i]);
  b[0] = 0;
  b[n - 1] = a[0];
  for (int i = 1; i < n / 2; i++) {
    b[n - 1 - i] = min(b[n - i], a[i] - b[i - 1]);
    b[i] = a[i] - b[n - 1 - i];
  }
  for (int i = 0; i < n; i++) printf("%lld ", b[i]);
  return 0;
}
