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
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ST first
#define ND second
#define ll long long
#define ld long double
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;
using namespace __gnu_pbds;
 
// replace ll  with pair if multiset needed
typedef tree<ll, null_type, greater<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ordered_set secik;
 
const ll  INF = 1e9 + 9;
const ll  MOD = 1e9 + 7;
const long long LINF = (ll)1e18 + 3;
 
// secik.insert({x, t++});
// secik.erase(secik.lower_bound({x,-1}));
// *secik.find_by_order(x)).first << "\n";
// secik.order_of_key(x)
 
//random_device device;
//mt19937 gener(device());
//uniform_int_distribution<ll > gen(0,n-1);
//gen(gener); // generate random number

int n;

ll getMedian(){
    int x = secik.size();
    if(secik.size() % 2 == 1){
        return 2*(*secik.find_by_order(x/2));
    } else {
        return (*secik.find_by_order(x/2) + *secik.find_by_order(x/2 - 1));
    }
}

bool good(){
    return (secik.size() + getMedian()) == 2*n+1;
}

int main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    
    cin >> n;
    vector<int> tab(n);
    ll ans = 0;
    for(int i = 0; i < n; i++) cin >> tab[i];
    for(int len = 1; len <= n; len++){
        secik.clear();
        for(int i = 0; i < len; i++) secik.insert(tab[i]);
        //cout << getMedian() << " " << endl;
        if(good()) ans++;
        for(int i = len; i < n; i++){
            secik.insert(tab[i]);
            secik.erase(tab[i-len]);
            if(good()) ans++;
        }
    }
    cout << 2*n+1 << " " << ans << "\n";
	
	return 0;
}