#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
int gcd(int a, int b) {
  while (b) {
    int t = a % b;
    a = b;
    b = t;
  }
  return a;
}
long long b[901000], a[901000];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%lld", &b[i]);
  for (int i = 0; i < n; i++) {
    if (i < n - 1)
      a[i] = b[i] + b[i + 1];
    else
      a[i] = b[i];
  }
  for (int i = 0; i < n; i++) printf("%lld ", a[i]);
}
