Problem:
Score : 400 points

Problem Statement

There are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.

Between these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \leq i \leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).

When Mountain i (1 \leq i \leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).

One day, each of the mountains received a non-negative even number of liters of rain.

As a result, Dam i (1 \leq i \leq N) accumulated a total of A_i liters of water.

Find the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.

Constraints

All values in input are integers.

3 \leq N \leq 10^5-1

N is an odd number.

0 \leq A_i \leq 10^9

The situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print N integers representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.

Sample Input 1

3
2 2 4

Sample Output 1

4 0 4

If we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:

Dam 1 should have accumulated \frac{4}{2} + \frac{0}{2} = 2 liters of water.

Dam 2 should have accumulated \frac{0}{2} + \frac{4}{2} = 2 liters of water.

Dam 3 should have accumulated \frac{4}{2} + \frac{4}{2} = 4 liters of water.

Sample Input 2

5
3 8 7 5 5

Sample Output 2

2 4 12 2 8

Sample Input 3

3
1000000000 1000000000 0

Sample Output 3

0 2000000000 0

Solution in C (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int max(int a,int b){
  if(a > b){
    return a;
  }
  return b;
}

long long min(long long a,long long b){
  if(a < b){
    return a;
  }
  return b;
}

int main(void){
  int N;
  scanf("%d", &N);

  long long A[N];
  long long minimam = 2e9;
  for (int i = 0; i < N; i++) {
    scanf("%lld", &A[i]);
    minimam = min(minimam, A[i]);
  }
  if(minimam%2 != 0 && minimam != 0) minimam -= 1;
  for (int i = 0; i < N; i++) {
    A[i] -= minimam;
  }

  long long ans[N];
  for (int i = 0; i <= max(A[0], A[N-1])*2; i++) {
    int flag = 0;
    ans[0] = i;
    for (int j = 0; j < N-1; j++) {
      ans[j+1] = A[j]*2-ans[j];
      if(ans[j+1] < -minimam){
        flag = 1;
        break;
      }
    }
    if(flag == 0){
      if(ans[0]+ans[N-1] == A[N-1]*2) break;
    }
  }

  for (int i = 0; i < N; i++) {
    printf("%lld", ans[i]+minimam);
    if(i != N-1) printf(" ");
  }

  return 0;
}