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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Text;

namespace codeTester.contest190707
{
    class ProblemD
    {
        static readonly long modBasis = 1000000007;
        static long n = 0;
        static List<long> values = new List<long>();
        static List<long> answers = new List<long>();

        public static void Main(string[] args)
        {
            Input();
            Logic();
            Output();
        }

        static void Input()
        {
            n = int.Parse(Console.ReadLine());
            values = ReadSpaceSeparatedValues();
        }

        public static List<long> ReadSpaceSeparatedValues()
        {
            List<long> values = new List<long>();
            string[] inputs = Console.ReadLine().Split(' ');
            foreach (string input in inputs)
            {
                values.Add(long.Parse(input));
            }

            return values;
        }

        static void Logic()
        {
            List<long> mayAnswer = new List<long>();
            // 山1に降った雨の量を 0 と仮定する
            long supposedMountain1Rain = 0;
            DebugPrint("-- suppose " + supposedMountain1Rain.ToString() + " --");
            mayAnswer = new List<long>();
            mayAnswer.Add(supposedMountain1Rain * 2);
            long remainRain = values[0] - supposedMountain1Rain; // 山1以外から来た雨量
            for (int damNo = 1; damNo < n; damNo++)
            {
                DebugPrint("damNo " + damNo.ToString() + ", remainRain " + remainRain.ToString());
                mayAnswer.Add(remainRain * 2);
                remainRain = values[damNo] - remainRain;
            }
            if (remainRain == supposedMountain1Rain)
            {
                answers = mayAnswer;
                return;
            }

            supposedMountain1Rain = remainRain / 2;
            DebugPrint("-- suppose " + supposedMountain1Rain.ToString() + " --");
            mayAnswer = new List<long>();
            mayAnswer.Add(supposedMountain1Rain * 2);
            remainRain = values[0] - supposedMountain1Rain; // 山1以外から来た雨量
            for (int damNo = 1; damNo < n; damNo++)
            {
                DebugPrint("damNo " + damNo.ToString() + ", remainRain " + remainRain.ToString());
                mayAnswer.Add(remainRain * 2);
                remainRain = values[damNo] - remainRain;
            }
            if (remainRain == supposedMountain1Rain)
            {
                answers = mayAnswer;
                return;
            }
        }

        static void Output()
        {
            Console.WriteLine(string.Join(" ", answers));
        }

        static void DebugPrint(string msg)
        {
            // 提出時に消す
            // Console.WriteLine(msg);
        }
    }
}