#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 == 1) return a[0];

	vector<int> dpA(n+1, INF);
	vector<int> dpB(n+1, INF);
	dpA[0] = 0;
	dpB[0] = 0;
	
	for(int i=1; i<=n; i++){
		
		int j = i-1;
		int sumA = a[i-1];
		int sumB = b[i-1];
		
		while(j>=0){
			
			dpA[i] = min( {dpA[i], dpA[j]+sumA , dpB[j]+sumA });
			
			if(i-j>=2)	dpB[i] = min( {dpB[i], dpA[j]+sumB , dpB[j]+sumB });
			
			if(j-1>=0) sumA += a[j-1];
			if(j-1>=0) sumB += b[j-1];
			j--;
		}
	}
	
	return min(dpA[n] , dpB[n]);
}




int consistency2(int n){
	
	if(n==1) return a[0];
	
	vector<int> dpA(n+1, INF);
	vector<int> dp1B(n+1, INF);
	vector<int> dp2B(n+1, INF);
	
	dpA[0] = 0;
	dp1B[0] = 0;
	dp2B[0] = 0;
	
	dpA[1] = a[0];
	dp1B[1] = b[0];
	dp2B[1] = INF;
	
	
	for(int i=2; i<=n; i++){
		
		dpA[i] = min( dpA[i-1] , dp2B[i-1] ) + a[i-1];
		dp2B[i] = min( dpA[i-2] , dp1B[i-2] ) + b[i-2] + b[i-1];
		dp1B[i] = min( dpA[i-1] , dp1B[i-1] ) + b[i-1];
	}
	
	return min( dpA[n] , dp2B[n] );
}














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;


}





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;
}