#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    ll d;
    cin >> d;
    vector<int> b(d+1);
    for (int i = 0; i < d+1; i++) cin >> b[i];
    reverse(b.begin(), b.end());
    if (d >= 3){
        int tmp;
        for (int i = 0; i < d - 2; i++){
            tmp = b[i];
            b[i] = 0;
            b[i+2] -= tmp*(-1);
        }
    }
    while (b.size() && !b[0]) {
        b.erase(b.begin());
    }
    reverse(b.begin(), b.end());
    if (b.empty()){
        cout << 0 << "\n" << 0 << "\n";
    } else {
        cout << b.size() - 1 << "\n";
        string delim = "";
        for (auto x : b){
        cout << delim << x;
        delim = " ";
        }
        cout << endl;
    }
}