#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>pre(n),suf(n);
    int mini=INT_MAX; int maxi = INT_MIN;
	for(int i = 0 ; i < n ; i++){
		mini= min(mini,arr[i]);
		pre[i]=mini;
	}
	for(int i = n-1 ; i >=0 ; i--){
		maxi= max(mini,arr[i]);
		suf[i]=maxi;
	}
	bool ans = false ; 
	for(int j = 1 ; j<n-1;j++){
		if(pre[j-1]<arr[j] && suf[j+1]>arr[j]) ans = true;
	}
	cout<<boolalpha;
	cout<<ans;
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbiA7IGNpbj4+bjsgCgl2ZWN0b3I8aW50PmFycihuKTsKCWZvcihpbnQgaSA9IDAgOyBpPG4gOyBpKyspewoJCWNpbj4+YXJyW2ldOwoJfQoJdmVjdG9yPGludD5wcmUobiksc3VmKG4pOwogICAgaW50IG1pbmk9SU5UX01BWDsgaW50IG1heGkgPSBJTlRfTUlOOwoJZm9yKGludCBpID0gMCA7IGkgPCBuIDsgaSsrKXsKCQltaW5pPSBtaW4obWluaSxhcnJbaV0pOwoJCXByZVtpXT1taW5pOwoJfQoJZm9yKGludCBpID0gbi0xIDsgaSA+PTAgOyBpLS0pewoJCW1heGk9IG1heChtaW5pLGFycltpXSk7CgkJc3VmW2ldPW1heGk7Cgl9Cglib29sIGFucyA9IGZhbHNlIDsgCglmb3IoaW50IGogPSAxIDsgajxuLTE7aisrKXsKCQlpZihwcmVbai0xXTxhcnJbal0gJiYgc3VmW2orMV0+YXJyW2pdKSBhbnMgPSB0cnVlOwoJfQoJY291dDw8Ym9vbGFscGhhOwoJY291dDw8YW5zOwoKCXJldHVybiAwOwp9

NgogNSA0IDMgMiAxIDgg

6
 5 4 3 2 1 8