#include <iostream>
#include<bits/stdc++.h>
using namespace std;
 
int main() {
		// your code goes here
 
	vector<int>arr1 ={-8,1,5,-6,2};
	vector<int>arr2 ={-9,2,3,-1,-3}; // assume filled
	int n = arr1.size();
	vector<int> dp(n + 1);
 
	dp[0] = 0;
	dp[1] = max({0, arr1[0], arr2[0]});
 
	for (int i = 2; i <= n; i++) {
	    dp[i] = max({
	        dp[i - 1],
	        dp[i - 2] + arr1[i - 1],
	        dp[i - 2] + arr2[i - 1]
	    });
	}
	cout<<dp[5];
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJCgl2ZWN0b3I8aW50PmFycjEgPXstOCwxLDUsLTYsMn07Cgl2ZWN0b3I8aW50PmFycjIgPXstOSwyLDMsLTEsLTN9OyAvLyBhc3N1bWUgZmlsbGVkCglpbnQgbiA9IGFycjEuc2l6ZSgpOwoJdmVjdG9yPGludD4gZHAobiArIDEpOwoJCglkcFswXSA9IDA7CglkcFsxXSA9IG1heCh7MCwgYXJyMVswXSwgYXJyMlswXX0pOwoJCglmb3IgKGludCBpID0gMjsgaSA8PSBuOyBpKyspIHsKCSAgICBkcFtpXSA9IG1heCh7CgkgICAgICAgIGRwW2kgLSAxXSwKCSAgICAgICAgZHBbaSAtIDJdICsgYXJyMVtpIC0gMV0sCgkgICAgICAgIGRwW2kgLSAyXSArIGFycjJbaSAtIDFdCgkgICAgfSk7Cgl9Cgljb3V0PDxkcFs1XTsKCglyZXR1cm4gMDsKfQ==