// 2023 IUSB Programming Competition
// Round 1 Problem 5
// Summation Steps
// Solution by Liguo Yu

import java.util.Scanner;

public class round1_p5
{   
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        int size = input.nextInt();
        int[] list = new int[size];

        for (int i=0; i<size; i++)
        {
            list[i] = input.nextInt();
        }
                
        print(list, size);
    }
     
    //for summation steps recursively
    public static void print(int[] array, int size)
    {
        if(size > 1)
        {
            int upsize = size - 1;
            int[] uparray = new int[upsize];
            for(int i=0; i<upsize; i++)
            {
                uparray[i] = array[i] + array[i+1];
            }
            print(uparray, upsize);
        }
        
        for(int i=0; i<size; i++)
        {
            System.out.print(array[i]);
            if(i != size-1)
                System.out.print(", ");
        }
        System.out.println();
    }
    
}