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

int consistency1(int n){

    vector<int> pMaxi(n+1, 0);
    for(int i=0; i<n; i++){
        pMaxi[i+1] = max(pMaxi[i], a[i]);
    }
    
    vector<int> sMaxi(n+1, 0);
    for(int i=n-1; i>=0; i--){
        sMaxi[i] = max(sMaxi[i+1], a[i]);
    }
    
    
    int ans = 0;
    for(int i=0; i<n; i++){
        int h = min(pMaxi[i], sMaxi[i+1]);
        if(h > a[i]) ans += h-a[i];
    }
    
    
    return ans;
}








int consistency2(int n){

    int ans = 0;    
    int s = 0, e = n-1;
    
    int leftMaxi = 0;
    int rightMaxi = 0;  
    
    while(s<e){
        leftMaxi = max(leftMaxi, a[s]);
        rightMaxi = max(rightMaxi, a[e]);   
        if(a[s] < a[e]){
            ans += min(leftMaxi, rightMaxi) - a[s];
            s++;
        }
        else{
            ans += min(leftMaxi, rightMaxi) - a[e];
            e--;
        }
    }
    
    
    return ans;
}











int practice(int n){


    return 0;
}





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