1195C.cpp

#include <bits/stdc++.h>
using namespace std;
template<typename T>
void _debug(const char* name, T&& value) {
    cerr << name << " = " << value << endl;
}
template<typename T, typename... Args>
 void _debug(const char* names, T&& value, Args&&... args) {
    const char* comma = strchr(names, ',');
    cerr.write(names, comma - names) << " = " << value << " | ";
    _debug(comma + 1, args...);
}


#define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__)
#define ll long long
#define REP(i,n) for(int i=0; i<n; i++)
#define RREP(i,n) for(int i=n-1; i>= 0; i--)
#define mod 1000000007

void solve()
{
    int n; cin >> n;
    vector<pair<ll, ll>> a(n);
    REP(i, n) cin >> a[i].first;
    REP(i, n) cin >> a[i].second;

    vector<ll> dp1(n);
    vector<ll> dp2(n);
    dp1[0] = a[0].first;
    dp2[0] = a[0].second;
    for(int i = 1; i < n; i++){
        dp1[i] = max(dp1[i-1], dp2[i-1] + a[i].first);
        dp2[i] = max(dp2[i-1], dp1[i-1] + a[i].second);
    }
    cout << max(dp1[n-1], dp2[n-1]) << "\n";
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    ll test=1;
    //cin>>test;
    while(test--)
    {
        solve();
    }
    return 0;
}