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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef double K;
constexpr int INF = 0x3f3f3f3f;

#define FOR(i, b, e) for(int i = (b); i < (e); i++)
#define TRAV(x, a) for(auto &x: (a))
#define SZ(x) ((int)(x).size())
#define PB push_back
#define X first
#define Y second

void solve() {
	int n;
	cin >> n;
	vector<ii> val(n);
	FOR(i, 0, n) {
		cin >> val[i].X;
		val[i].Y = i;
	}
	sort(val.rbegin(), val.rend());
	int mini = INF, maxi = -INF;
	ll ans = 0;
	FOR(i, 0, (n + 1) / 2) {
		mini = min(mini, val[i].Y);
		maxi = max(maxi, val[i].Y);
		FOR(dl, i * 2, i * 2 + 2) {
			int l = max(maxi - dl + 1, 0);
			int r = min(mini + dl, n);
			ans += max(r - l - dl + 1, 0);
		}
	}
	cout << n * 2 + 1 << ' ' << ans + (n % 2 == 0) << '\n';
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	// int tt; cin >> tt;
	// FOR(te, 0, tt) {
	// 	// cout << "Case #" << te + 1 << ": ";
	// 	solve();
	// }
	solve();
	return 0;
}