#include <bits/stdc++.h>
using namespace std;
long long int mod_pow(long long int a, long long int b, long long int m) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return res;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) cin >> a[i];
  for (long long int i = 0; i < n - 1; i++) cout << a[i] + a[i + 1] << " ";
  cout << a[n - 1];
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int q;
  q = 1;
  while (q--) solve();
  return 0;
}
