#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin>>n;
vector<int>arr(n,0);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int k1;
cin>>k1;
int p;
for(int i=0;i<n;i++){
if(arr[i]==k1){
p=i;
break;
}
}
int a;
for(int i=p-1;i>=0;i--){
if(arr[i]>arr[p]){
a=i;
break;
}
}
int b;
for(int i=p+1;i<n;i++){
if(arr[i]>arr[p]){
b=i;
break;
}
}
int x=0;
int y=0;
int c=p-1;
int d=p+1;
for(int i=a+1;i<=c;i++){
x++;
}
for(int j=d;j<b;j++){
y++;
}
int count=0;
count=(x+1)*(y+1);
cout<<"The number of subarrays with max element k is:"<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbjsKCWNpbj4+bjsKCXZlY3RvcjxpbnQ+YXJyKG4sMCk7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PmFycltpXTsKCX0KCWludCBrMTsKCWNpbj4+azE7CglpbnQgcDsKCWZvcihpbnQgaT0wO2k8bjtpKyspewogICAgICAgIGlmKGFycltpXT09azEpewogICAgICAgIAlwPWk7CiAgICAgICAgCWJyZWFrOwogICAgICAgIH0KCX0KCWludCBhOwoJZm9yKGludCBpPXAtMTtpPj0wO2ktLSl7CgkJaWYoYXJyW2ldPmFycltwXSl7CgkJCWE9aTsKCQkJYnJlYWs7CgkJfQoJfQoJaW50IGI7Cglmb3IoaW50IGk9cCsxO2k8bjtpKyspewoJCWlmKGFycltpXT5hcnJbcF0pewoJCQliPWk7CgkJCWJyZWFrOwoJCX0KCX0KCWludCB4PTA7CglpbnQgeT0wOwoJaW50IGM9cC0xOwoJaW50IGQ9cCsxOwoJZm9yKGludCBpPWErMTtpPD1jO2krKyl7CgkJeCsrOwoJfQoJZm9yKGludCBqPWQ7ajxiO2orKyl7CgkJeSsrOwoJfQoJaW50IGNvdW50PTA7Cgljb3VudD0oeCsxKSooeSsxKTsKCWNvdXQ8PCJUaGUgbnVtYmVyIG9mIHN1YmFycmF5cyB3aXRoIG1heCBlbGVtZW50IGsgaXM6Ijw8Y291bnQ7CglyZXR1cm4gMDsKfQ==