#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int maxm = (1 << 20) + 10;
const long long inf = 1e18;
const int mod = 1e9 + 7;
long long gcd(long long a, long long b) {
  while (a && b) {
    if (a >= b)
      a %= b;
    else
      b %= a;
  }
  return a + b;
}
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long power(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
int getint() {
  char c;
  while ((c = getchar()) && !(c >= '0' && c <= '9') && c != '-')
    ;
  int ret = c - '0', sgn = 0;
  if (c == '-') sgn = 1, ret = 0;
  while ((c = getchar()) && c >= '0' && c <= '9') ret = ret * 10 + c - '0';
  if (sgn) ret = -ret;
  return ret;
}
long long a[maxn], b[maxn];
int main() {
  int n = getint();
  for (int i = 1; i <= n; i++) a[i] = getint();
  for (int i = 1; i < n; i++) b[i] = a[i] + a[i + 1];
  b[n] = a[n];
  for (int i = 1; i <= n; i++) cout << b[i] << " ";
  return 0;
}
