#include <bits/stdc++.h>
using namespace std;
int getCount(int n,vector<int>&arr,int k){
int count=0;
for(int i=0;i<n;i++){
int maxi=arr[i];
bool got=(arr[i]==k);
for(int j=i;j<n;j++){
if(arr[j]==k){
got=true;
}
maxi=max(maxi,arr[j]);
if(got==true && maxi==k){
count++;
}
}
}
return count;
}
int main() {
// your code goes here
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
int k;
cin>>k;
cout<<"The count of subarray with maximum element k is:"<<getCount(n,v,k);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRDb3VudChpbnQgbix2ZWN0b3I8aW50PiZhcnIsaW50IGspewoJaW50IGNvdW50PTA7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlpbnQgbWF4aT1hcnJbaV07CgkJYm9vbCBnb3Q9KGFycltpXT09ayk7CgkJZm9yKGludCBqPWk7ajxuO2orKyl7CgkJCWlmKGFycltqXT09ayl7CgkJCQlnb3Q9dHJ1ZTsKCQkJfQoJCQltYXhpPW1heChtYXhpLGFycltqXSk7CgkJCWlmKGdvdD09dHJ1ZSAmJiBtYXhpPT1rKXsKCQkJCWNvdW50Kys7CgkJCX0KCQl9Cgl9CglyZXR1cm4gY291bnQ7Cn0KCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PnYobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PnZbaV07Cgl9CglpbnQgazsKCWNpbj4+azsKCWNvdXQ8PCJUaGUgY291bnQgb2Ygc3ViYXJyYXkgd2l0aCBtYXhpbXVtIGVsZW1lbnQgayBpczoiPDxnZXRDb3VudChuLHYsayk7CgkKCXJldHVybiAwOwp9