1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <bits/stdc++.h>

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set
#define sqr(x) (x)*(x)
#define pw(x) (1ll << (x))
#define sz(x) (int)x.size()
#define fout(x) {cout << x << "\n"; return; }

using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN = 1e5;
const int M = pw(16);
const long long mod = 1e9 + 7;
const int N = 5e5;
const ll inf = 1e18;
template <typename T> void vout(T s){cout << s << endl;exit(0);}


int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    vector <int> a(n), pos(n + 1);

    int ans = 1 + 2 * n;
    ll ans1 = 0;

    int idx = 0;

    for(int &i : a){
        cin >> i;
        pos[i] = ++idx;
    }   

    int l, r;

    l = r = pos[n];

    ll uk = 1;

    for(int len = 1; len <= n; len++){
        while(len / 2 + 1 > uk){
            l = min(l, pos[n - uk]);
            r = max(r, pos[n - uk]);
            uk++;
        }

        if(r - l + 1 <= len){
            int le1, ri1;
            ri1 = min(n - len + 1, l);
            le1 = max(1, r - len + 1);            
            ans1 += ri1 - le1 + 1;            
        }

    }

    cout << ans << " " << ans1 << "\n"; 

    return 0;
}