#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)

/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#define PII pair<int,int>
/////////
using namespace::std;

// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
vector<ULL> fib;
void makeFib(int N){
	fib = vector<ULL>(N+1);
	fib[1] = 1;
	fib[2] = 1;
	for(int i=3;i<=N;++i){
		fib[i] = fib[i-1]+fib[i-2];
	}
}
inline void solve(){
	int N;
	cin >> N;
	vector<ULL> B(N);
	for(int i=0;i<N;++i){
		cin >> B[i];
	}
	vector<ULL> A(N+1,0);
	A[0] = 1;
	ULL add = 0;
	for(int i=1;i<N+1;++i){
		if( i & 1){
			A[i] = B[i-1]-A[i-1]-2*add;
		}
		else{
			if( A[i-1]+add <= B[i-1]){
				add = B[i-1]-A[i-1]-add;
			}
			A[i] = A[i-1]+add-B[i-1];
		}
		if( A[i] == 0){
			cout << -1 << endl;
			return;
		}
	}

	{
		cout << N+1 << '\n';
		for(int i=0;i<=N;++i){
			cout << A[i] + add << '\n';
		}cout << flush;
	}
}

signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	//std::cout << std::fixed;//小数を10進数表示
	//cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();
}