#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin>>n;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
vector<int> suffix(n+1,0);
for(int i=n-1;i>=0;i--){
suffix[i]=max(suffix[i+1],arr[i]);
}
int mini = arr[0];
for(int i=1;i<n-1;i++){
if(arr[i]>mini && arr[i]<suffix[i+1]){
cout<<"true"<<endl;
return 0;
}
mini = min(mini,arr[i]);
}
cout<<"false"<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PiBhcnIobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PmFycltpXTsKCQkKCX0KCQogICB2ZWN0b3I8aW50PiBzdWZmaXgobisxLDApOwogICBmb3IoaW50IGk9bi0xO2k+PTA7aS0tKXsKICAgCXN1ZmZpeFtpXT1tYXgoc3VmZml4W2krMV0sYXJyW2ldKTsKICAgfQogICBpbnQgbWluaSA9IGFyclswXTsKICAgCiAgIGZvcihpbnQgaT0xO2k8bi0xO2krKyl7CiAgIAkgIGlmKGFycltpXT5taW5pICYmIGFycltpXTxzdWZmaXhbaSsxXSl7CiAgIAkgIAljb3V0PDwidHJ1ZSI8PGVuZGw7CiAgIAkgIAlyZXR1cm4gMDsKICAgCSAgCQogICAJICAJCiAgIAkgIH0KICAgCSAgbWluaSA9IG1pbihtaW5pLGFycltpXSk7CiAgIAkgIAogICB9CiAgIAogICBjb3V0PDwiZmFsc2UiPDxlbmRsOwogICAKCXJldHVybiAwOwp9