#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;

int consistency1(int n){
	if(n==0) return 0;
	if(n==1) return max(a[0], b[0]);
	if(n==2) return max({ a[0]+a[1], a[0]+b[1] , b[0]+b[1] , b[0]+a[1]  });
	
	vector<vector<int>> dpA(n, vector<int>(2, 0));
	vector<vector<int>> dpB(n, vector<int>(2, 0));
	
	
	dpA[0][0] = a[0];
	dpA[0][1] = 0;
	dpA[1][0] = b[0] + a[1];
	dpA[1][1] = a[0] + a[1];
	
	dpB[0][0] = b[0];
	dpB[0][1] = 0;
	dpB[1][0] = a[0] + b[1];
	dpB[1][1] = b[0] + b[1];
	
	for(int i=2; i<n; i++){
		dpA[i][0] = a[i] + max( dpB[i-1][0] , dpB[i-1][1] );
		dpB[i][0] = b[i] + max( dpA[i-1][0] , dpA[i-1][1] );
		
		dpA[i][1] = max( a[i] + a[i-1] + max(dpB[i-2][0], dpB[i-2][1]) , a[i] + dpA[i-1][0] );
		dpB[i][1] = max( b[i] + b[i-1] + max(dpA[i-2][0], dpA[i-2][1]) , b[i] + dpB[i-1][0] );
		
	}
	
	return max({dpA[n-1][0], dpA[n-1][1], dpB[n-1][0], dpB[n-1][1] });
	
}





int consistency2(int n){
	if(n==0) return 0;
	if(n==1) return max(a[0], b[0]);
	if(n==2) return max({ a[0]+a[1], a[0]+b[1] , b[0]+b[1] , b[0]+a[1]  });
	
	vector<vector<vector<int>>> dp(n, vector<vector<int>>(2, vector<int>(2, 0)));
	
	dp[0][0][0] = a[0];
    dp[0][0][1] = a[0];
    dp[0][1][0] = b[0];
    dp[0][1][1] = b[0];
    
    dp[1][0][0] = a[0] + a[1];
    dp[1][0][1] = b[0] + a[1];
    dp[1][1][0] = a[0] + b[1];
    dp[1][1][1] = b[0] + b[1];
	
	for(int i=2; i<n; i++){
		dp[i][0][0] =  a[i] + a[i-1] + max( dp[i-2][1][0], dp[i-2][1][1] );
		
		dp[i][0][1] =  a[i] + b[i-1] + max( {dp[i-2][1][0] , dp[i-2][0][1] , dp[i-2][0][0]  } );
		
		dp[i][1][1] = b[i] + b[i-1] + max( dp[i-2][0][1], dp[i-2][0][0] );
		
		dp[i][1][0] = b[i] + a[i-1] + max( {dp[i-2][0][1] , dp[i-2][1][0] , dp[i-2][1][1]  } );
	}
	
	return max( {dp[n-1][0][0], dp[n-1][0][1], dp[n-1][1][0], dp[n-1][1][1] });
}









int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << consistency1(n) << " " << consistency2(n) << endl;
    // cout << consistency1(n)  << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}