#include <bits/stdc++.h>
using namespace std;
bool avail(int n,int arr[]){
unordered_map<int,int>preHash;
unordered_map<int,int>suffHash;
preHash[arr[0]]++;
suffHash[arr[n-1]]++;
for(int i=1;i<n-1;i++){
suffHash[arr[i+1]]++;
if(preHash.find(arr[i]-1)!=preHash.end() && suffHash.find(arr[i]+1)!=suffHash.end()){
return true;
}
preHash[arr[i]]++;
}
return false;
}
int main() {
// your code goes here
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
if(avail(n,arr)){
cout<<"There exits triplets";
}
else{
cout<<"There does exits triplets";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmJvb2wgYXZhaWwoaW50IG4saW50IGFycltdKXsKCXVub3JkZXJlZF9tYXA8aW50LGludD5wcmVIYXNoOwoJdW5vcmRlcmVkX21hcDxpbnQsaW50PnN1ZmZIYXNoOwoJcHJlSGFzaFthcnJbMF1dKys7CglzdWZmSGFzaFthcnJbbi0xXV0rKzsKCWZvcihpbnQgaT0xO2k8bi0xO2krKyl7CgkJc3VmZkhhc2hbYXJyW2krMV1dKys7CgkJaWYocHJlSGFzaC5maW5kKGFycltpXS0xKSE9cHJlSGFzaC5lbmQoKSAmJiBzdWZmSGFzaC5maW5kKGFycltpXSsxKSE9c3VmZkhhc2guZW5kKCkpewoJCQlyZXR1cm4gdHJ1ZTsKCQl9CgkJcHJlSGFzaFthcnJbaV1dKys7Cgl9CglyZXR1cm4gZmFsc2U7Cn0KIAppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuOwoJY2luPj5uOwoJaW50IGFycltuXTsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWNpbj4+YXJyW2ldOwoJfQoJaWYoYXZhaWwobixhcnIpKXsKCQljb3V0PDwiVGhlcmUgZXhpdHMgdHJpcGxldHMiOwoJfQoJZWxzZXsKCQljb3V0PDwiVGhlcmUgZG9lcyBleGl0cyB0cmlwbGV0cyI7Cgl9CglyZXR1cm4gMDsKfQ==