#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<vector<int>> a;

int consistency1(int n){

	vector<int> dpE(n);
	vector<int> dpH(n);
	vector<int> dpN(n);
	
	dpE[0] = a[0][0];
	dpH[0] = a[0][1];
	dpN[0] = 0;
	
	for(int i=1; i<n; i++){
		 dpE[i] = a[i][0] + max({ dpE[i-1], dpH[i-1], dpN[i-1] }); 

         dpH[i] = a[i][1] + dpN[i-1];

         dpN[i] = max({ dpE[i-1], dpH[i-1], dpN[i-1] }); 
	}
	
	
	return max({ dpE[n-1], dpH[n-1], dpN[n-1] }) ;

}



int consistency2(int n){

	vector<int> dpE(n);
	vector<int> dpH(n);
	
	dpE[0] = a[0][0];
	dpH[0] = a[0][1];
	
	for(int i=1; i<n; i++){
		 dpE[i] = a[i][0] + max( dpE[i-1], dpH[i-1] ); 

         dpH[i] = a[i][1];
         if(i-2>=0) dpH[i] += max(dpE[i-2], dpH[i-2]);

	}
	
	
	return max(dpE[n-1], dpH[n-1]) ;

}











int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++){
    	int x, y;
    	cin >> x >> y;
    	a[i] = {x, y};
    }
    
    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;
}