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

// 7
// 5 8 8 9 11 12 13 


vector<int> a;

int consistency1(int n){

	int ans = a[0];
	
	for(int i=1; i<n; i++){
		
		int sum = a[i];
		ans += a[i];
		int j = i-1;
		
		int dif = a[j+1] - a[j];
		
		if(dif != 0 && dif != 1 ) continue;
		
		while(j>=0 && a[j+1] - a[j] == dif){
			
			sum += a[j];
			ans += sum;
			j--;
		}
	}
	
	return ans;
}







int consistency2(int n){

	
	int ans1 = 0;
	
	int last = 0;
	int len = 0;
	
	for(int i=0; i<n; i++){
		
		if(i-1>=0 && a[i] - a[i-1] == 1){
			len++;
			last = len*a[i] + last;
			ans1 += last;
			
		}
		else{
			len = 1;
			last = a[i];
			ans1 += last;
		}
	}
	
	int ans2 = 0;
	last = 0;
	len = 0;
	
	for(int i=0; i<n; i++){
		
		if(i-1>=0 && a[i] - a[i-1] == 0){
			len++;
			last = len*a[i] + last;
			ans2 += last;
		}
		else{
			len = 1;
			last = a[i];
			ans2 += last;
		}
	}
	
	
	int ans = ans1 + ans2;
	
	for(int i=0; i<n; i++) ans -= a[i];

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