#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <array>
#include <climits>
#include <bitset>
#include <cassert>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.setf(ios::fixed);
	cout.precision(20);

	int d;
	cin >> d;
	vector<int> a(d+1);
	rep(i, d+1) cin >> a[i];
	reverse(ALL(a));

	for (int i = 0; i <= d - 3; ++i){
		a[i + 2] += a[i];
	}

	int dd = 2;
	for (int i = d - 2; i <= d; ++i){
		if (d - dd == i && !a[i]) --dd;
	}
	if (dd < 0){
		cout << 0 << '\n' << 0 << endl;
		return 0;
	}

	cout << dd << endl;
	for (int i = d; i >= d - dd; --i){
		cout << a[i] << " \n"[i == d - dd];
	}
}