#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< pair<long long, long long> > vllll;
typedef map<int, int> mii;
typedef map<long long, long long> mllll;
typedef queue<int> qi;
typedef queue< pair<int, int> > qp;
#define mp make_pair
#define pi 3.14159265358979323846
#define MAX max_element
#define MIN min_element
#define all(v) v.begin(), v.end()
#define gt(T) greater<T>()
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define uni(v) do{ \
  sort(v.begin(), v.end()); \
  decltype(v)::iterator result = unique(v.begin(), v.end()); \
  v.erase(result, v.end()); \
}while(0)
#define fi(init, n) for(int i = init; i < n; ++i)
#define fj(init, n) for(int j = init; j < n; ++j)
#define fk(init, n) for(int k = init; k < n; ++k)
#define zero(x) memset(x, 0, sizeof(x))
#define negative(x) memset(x, ~0, sizeof(x))
#define bitsum(x) __builtin_popcount(x)
const ll MOD = 1e9 + 7;
const int INF = 1e9;
const int di[] = { 0, 1, 0, -1 };
const int dj[] = { 1, 0, -1, 0 };

template<typename T>
T gcd(T a, T b) {
	return b ? gcd(b, a % b) : a;
}
template<typename T>
T lcm(T a, T b) {
	return a / gcd(a, b) * b;
}
template<typename T>
int finder(vector<T> vec, T number) {
	auto itr = find(vec.begin(), vec.end(), number);
	size_t index = distance(vec.begin(), itr);
	if (index != vec.size()) return 1;
	else return 0;
}
ll frac(ll n){
	if (n == 0) return 1;
	return (n * frac(n - 1)) % MOD;
}
template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

int main(int argc, char** argv) {
#ifdef HIRO
  string quiz(argv[1]);
  string id(argv[2]);
  string filename("input/" + quiz + "/" + id + ".txt");
  ifstream fin(filename);
  if (fin.peek() == ifstream::traits_type::eof()) {
    cout << "No input.";
    return 0;
  }
  ifstream cin(filename);
  std::cin.rdbuf(cin.rdbuf());
#endif
  // ex: N = 5
  // let x: water of mountain, y: water of dam
  // x1 + x2 = 2y1
  // x2 + x3 = 2y2
  // x3 + x4 = 2y3
  // x4 + x5 = 2y4
  // x5 + x1 = 2y5
  //
  // => x1 = 2y1 - x2
  //       = 2y1 - 2y2 + x3
  //       = 2y1 - 2y2 + 2y3 - x4
  //       = 2y1 - 2y2 + 2y3 - 2y4 + x5
  //       = 2y1 - 2y2 + 2y3 - 2y4 + 2y5 - x1
  // => x1 = y1 - y2 + y3 - y4 + y5
  // => x2 = y2 - y3 + y4 - y5 + y1
  //    x3 = y3 - y4 + y5 - y1 + y2
  //    ...
  //    x5 = y5 - y1 + y2 - y3 + y4
  //
  //   x1:
  //     (-) | y1    y3    y5  (+)
  //     (+) |    y2    y4     (-)
  //   x2:
  //     (+) y1 |    y3    y5  (-)
  //     (-)    | y2    y4     (+)
  //   x3:
  //     (-) y1    | y3    y5  (+)
  //     (+)    y2 |    y4     (-)
  //   x4:
  //     (+) y1    y3 |    y5  (-)
  //     (-)    y2    | y4     (+)
  //   x5:
  //     (-) y1    y3    | y5  (+)
  //     (+)    y2    y4 |     (-)
  ll n;
  cin >> n;
  ll arr[n];
  ll r_even_sum = 0, r_odd_sum = 0, l_even_sum = 0, l_odd_sum = 0;
  int plus_minus = 1;
  fi(0, n) {
    cin >> arr[i];
    if(i % 2)
      r_odd_sum += arr[i];
    else
      r_even_sum += arr[i];
  }
  
  fi(0, n) {
    if(i > 0) {
      if((i - 1) % 2) {
        r_odd_sum -= arr[(i - 1)];
        l_odd_sum += arr[(i - 1)];
      }
      else {
        r_even_sum -= arr[(i - 1)];
        l_even_sum += arr[(i - 1)];
      }
    }
    // printf("%lld %lld %lld %lld\n", r_even_sum, r_odd_sum, l_odd_sum, l_even_sum);
    cout << (r_even_sum - r_odd_sum + l_odd_sum - l_even_sum) * plus_minus << endl;
    plus_minus *= -1;
  }
  return 0;
}



Measured memory_bytes: 2048