#include <iostream>
using namespace std;
#include <bits/stdc++.h>
#include<vector>
int main() {
	// your code goes here
	vector<int>arr={18,5,4,3,2,1,8,10};
	int n=arr.size();
	int suffix[n];
	suffix[n-1]=arr[n-1];
	for(int i=n-2;i>=0;i--)
	 {
	 	suffix[n-2]=max(suffix[n-1],suffix[i]);
	 }
	 int flag=0;
	 int p=arr[0];
	for(int i=1;i<=n-1;i++)
	 {
	 	if(p<arr[i]&&arr[i]<<suffix[i])
	 	 {
	 	 	cout<<"true";
	 	 	flag=1;
	 	 	break;
	 	 }
	 	 p=min(arr[i],p);
	 }
	 if(flag==0)
	  cout<<"false";
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KI2luY2x1ZGU8dmVjdG9yPgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXZlY3RvcjxpbnQ+YXJyPXsxOCw1LDQsMywyLDEsOCwxMH07CglpbnQgbj1hcnIuc2l6ZSgpOwoJaW50IHN1ZmZpeFtuXTsKCXN1ZmZpeFtuLTFdPWFycltuLTFdOwoJZm9yKGludCBpPW4tMjtpPj0wO2ktLSkKCSB7CgkgCXN1ZmZpeFtuLTJdPW1heChzdWZmaXhbbi0xXSxzdWZmaXhbaV0pOwoJIH0KCSBpbnQgZmxhZz0wOwoJIGludCBwPWFyclswXTsKCWZvcihpbnQgaT0xO2k8PW4tMTtpKyspCgkgewoJIAlpZihwPGFycltpXSYmYXJyW2ldPDxzdWZmaXhbaV0pCgkgCSB7CgkgCSAJY291dDw8InRydWUiOwoJIAkgCWZsYWc9MTsKCSAJIAlicmVhazsKCSAJIH0KCSAJIHA9bWluKGFycltpXSxwKTsKCSB9CgkgaWYoZmxhZz09MCkKCSAgY291dDw8ImZhbHNlIjsKCSAKCXJldHVybiAwOwp9