#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define aLL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define F(i,j,k) fill(i[0],i[0]+j*j,k) #define P(p) cout<<(p)< vi; typedef vector vl; typedef vector vd; typedef pair pii; typedef pair pll; typedef long long ll; int dx[] = { 0, 1, 0, -1 }; int dy[] = { -1, 0, 1, 0 }; int sttoi(std::string str) { int ret; std::stringstream ss; ss << str; ss >> ret; return ret; } bool sort_greater(const pair &a, const pair &b) { return a.second > b.second; } void solve() { int d; cin >> d; int a[10001]; rep(i, d+1){ cin >> a[i]; } int pos = d; while(true){ if (pos < 3){ break; } a[pos - 2] += a[pos]; a[pos] = 0; pos--; } int max = -1; rep(i, 3){ if (a[i] != 0){ max = i; } } if (max == -1){ P(0); P(0); } else{ P(max); rep(i, max+1){ cout << a[i]; if (i != max)cout << " "; } cout << endl; } } int main() { solve(); return 0; }