#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
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(){
    ll n;cin >> n;
    vl v(n);rep(i,n)cin >> v[i];
    vl ans(n+1);
    ans[0]=1;
    rep(i,n){
        if(i%2==0)ans[i+1]=v[i]-ans[i];
        else ans[i+1]=ans[i]-v[i];
    }
    ll up=0;
    ll m=1e18;
    rep(i,n+1){
        if(i%4==1||i%4==2){
            if(ans[i]>m)chmax(up,ans[i]-m);
        }
        else{
            if(ans[i]<1)chmax(up,1LL-ans[i]);
        }
    }
    bool ok=true;
    rep(i,n+1){
        if(i%4==1||i%4==2)ans[i]-=up;
        else ans[i]+=up;
        if(ans[i]<1||ans[i]>m)ok=false;
    }
    if(!ok){
        cout << -1 << endl;return 0;
    }
    cout << n+1 << endl;
    rep(i,n+1)cout << ans[i] << endl;
}