// TC : O(N^2)
// SC : O(N)
#include <iostream>
#include<unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for(int i=0; i<n; i++) {
cin >> arr[i];
}
int count = 0;
int k;
cin >> k;
int sum = 0;
unordered_map<int, int> mp;
for(int i=0, j=0; j < n; j++) {
mp[arr[j]]++; // [i ............... j]
int distinct = mp.size();
while(distinct > k) {
mp[arr[i]]--;
if(mp[arr[i]] == 0) {
mp.erase(arr[i]);
}
i++;
distinct = mp.size();
}
count += (j - i + 1);
}
cout << "Count : " << count;
return 0;
}
Ly8gVEMgOiBPKE5eMikKLy8gU0MgOiBPKE4pCgojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlPHVub3JkZXJlZF9tYXA+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CgkKCWludCBhcnJbbl07Cglmb3IoaW50IGk9MDsgaTxuOyBpKyspIHsKCQljaW4gPj4gYXJyW2ldOwoJfQoJCglpbnQgY291bnQgPSAwOwoJaW50IGs7CgljaW4gPj4gazsKCQoJaW50IHN1bSA9IDA7Cgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBtcDsKCglmb3IoaW50IGk9MCwgaj0wOyBqIDwgbjsgaisrKSB7CgkJbXBbYXJyW2pdXSsrOyAvLyBbaSAuLi4uLi4uLi4uLi4uLi4gal0KCQkKCQlpbnQgZGlzdGluY3QgPSBtcC5zaXplKCk7CgkJCgkJd2hpbGUoZGlzdGluY3QgPiBrKSB7CgkJCW1wW2FycltpXV0tLTsKCQkJaWYobXBbYXJyW2ldXSA9PSAwKSB7CgkJCQltcC5lcmFzZShhcnJbaV0pOwoJCQl9CgkJCWkrKzsKCQkJCgkJCWRpc3RpbmN0ID0gbXAuc2l6ZSgpOwoJCX0KCQljb3VudCArPSAoaiAtIGkgKyAxKTsKCX0KCWNvdXQgPDwgIkNvdW50IDogIiA8PCBjb3VudDsKCXJldHVybiAwOwp9