def main():
num_of_tests = int(input())
pairs = list(map(int, input().split()))
pairs.append(pairs[len(pairs)-2])
pair = []
for i in range (0, len(pairs)-1):
first = pairs[i]
sec = pairs[i + 1]
pair.append([first,sec])
try:
for i in pair:
for j in pair:
j.sort()
x1 = i[0]
x2 = i[1]
x3 = j[0]
x4 = j[1]
if x1 < x3 and x3 < x2 and x2 < x4:
print('yes')
exit()
elif x3 < x1 and x1 < x4 and x4 < x2:
print('yes')
exit()
print('no')
except IndexError:
print('no')
exit()
main()#include <bits/stdc++.h>
using namespace std;
const int ss = 1e3;
#define x1 v[i]
#define x2 v[i + 1]
#define x3 v[j]
#define x4 v[j + 1]
int main() {
int n;
cin >> n;
if (n <= 2) {
cout << "no";
return 0;
}
int v[ss];
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n - 1; ++i) {
for (int j = 0; j < n - 1; ++j) {
if (i == j)
continue;
if ((x3 > x1 and x3 < x2 and x4 > x2) or
(x4 > x1 and x4 < x2 and x3 > x2) or
(x3 > x2 and x3 < x1 and x4 > x1) or
(x4 > x2 and x4 < x1 and x3 > x1)) {
cout << "yes";
return 0;
}
}
}
cout << "no";
return 0;
}1177B - Digits Sequence (Hard Edition) | 1155B - Game with Telephone Numbers |
1284A - New Year and Naming | 863B - Kayaking |
1395B - Boboniu Plays Chess | 1475D - Cleaning the Phone |
617B - Chocolate | 1051B - Relatively Prime Pairs |
95B - Lucky Numbers | 1692D - The Clock |
1553D - Backspace | 1670D - Very Suspicious |
1141B - Maximal Continuous Rest | 1341A - Nastya and Rice |
1133A - Middle of the Contest | 385A - Bear and Raspberry |
1311B - WeirdSort | 1713F - Lost Array |
236B - Easy Number Challenge | 275A - Lights Out |
147A - Punctuation | 253A - Boys and Girls |
1327E - Count The Blocks | 984A - Game |
12B - Correct Solution | 1355B - Young Explorers |
485A - Factory | 628A - Tennis Tournament |
1436B - Prime Square | 1707B - Difference Array |