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
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
#include <bits/stdc++.h>

#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define vll vector<ll>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vvvvll vector<vvvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)

using namespace std;


void solve() {
    int n; cin >> n;
    vi a(n);
    vi pos(n);

    rep(i, 0, n) {
        cin >> a[i];
        a[i]--;
        pos[a[i]] = i;
    }

    int best = 2 * n + 1;

    if (n == 1) {
        cout << best << " " << 1 << endl;
        return;
    }

    int l = pos[n - 1];
    int r = pos[n - 1];
    ll cnt = 2; // n alone and the whole array

    for (int x = n - 2; x > 0; x--) {
        l = min(l, pos[x]);
        r = max(r, pos[x]);

        if (pos[x - 1] > l && pos[x - 1] < r)
            continue;

        int maxlen = 2 * (n - x) - 1;

        if (pos[x - 1] < l) {
            for (int i = pos[x - 1] + 1; i <= l; i++) {
                if (i + maxlen - 1 < r)
                    continue;
                int nr = min(n - 1, i + maxlen - 1);
                cnt += (ll)(nr - r + 1);
            }
        }
        else {
            for (int i = pos[x - 1] - 1; i >= r; i--) {
                if (i - maxlen + 1 > l)
                    continue;
                int nl = max(0, i - maxlen + 1);
                cnt += (ll)(l - nl + 1);
            }
        }
    }

    cout << best << " " << cnt << endl;
}


int main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    bool _multipleTestCases = false;

    if (_multipleTestCases) {
        ll t; cin >> t;
        while (t--)
            solve();
    }
    else {
        solve();
    }

    return 0;
}