#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int k;
cin >> k;
unordered_map<int, int> mpp;
for (int i = 0; i < n; i++) {
if (mpp.find(arr[i]) != mpp.end() && i - mpp[arr[i]] <= k) {
cout << "true" << endl;
return 0;
}
mpp[arr[i]] = i;
}
cout << "false" << endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8dW5vcmRlcmVkX21hcD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgaW50IG47CiAgICBjaW4gPj4gbjsKCiAgICB2ZWN0b3I8aW50PiBhcnIobik7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGNpbiA+PiBhcnJbaV07CiAgICB9CgogICAgaW50IGs7CiAgICBjaW4gPj4gazsKCiAgICB1bm9yZGVyZWRfbWFwPGludCwgaW50PiBtcHA7IAogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBpZiAobXBwLmZpbmQoYXJyW2ldKSAhPSBtcHAuZW5kKCkgJiYgaSAtIG1wcFthcnJbaV1dIDw9IGspIHsKICAgICAgICAgICAgY291dCA8PCAidHJ1ZSIgPDwgZW5kbDsKICAgICAgICAgICAgcmV0dXJuIDA7IAogICAgICAgIH0KICAgICAgICBtcHBbYXJyW2ldXSA9IGk7IAogICAgfQoKICAgIGNvdXQgPDwgImZhbHNlIiA8PCBlbmRsOyAKICAgIHJldHVybiAwOwp9Cg==