Codeforces Round #416 (Div. 2) has been moved to start on 27.05.2017 09:35 (UTC).
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Dima and Continuous Line

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDima and Seryozha live in an ordinary dormitory room for two. One day Dima had a date with his girl and he asked Seryozha to leave the room. As a compensation, Seryozha made Dima do his homework.

The teacher gave Seryozha the coordinates of *n* distinct points on the abscissa axis and asked to consecutively connect them by semi-circus in a certain order: first connect the first point with the second one, then connect the second point with the third one, then the third one with the fourth one and so on to the *n*-th point. Two points with coordinates (*x*_{1}, 0) and (*x*_{2}, 0) should be connected by a semi-circle that passes above the abscissa axis with the diameter that coincides with the segment between points. Seryozha needs to find out if the line on the picture intersects itself. For clarifications, see the picture Seryozha showed to Dima (the left picture has self-intersections, the right picture doesn't have any).

Seryozha is not a small boy, so the coordinates of the points can be rather large. Help Dima cope with the problem.

Input

The first line contains a single integer *n* (1 ≤ *n* ≤ 10^{3}). The second line contains *n* distinct integers *x*_{1}, *x*_{2}, ..., *x*_{n} ( - 10^{6} ≤ *x*_{i} ≤ 10^{6}) — the *i*-th point has coordinates (*x*_{i}, 0). The points are not necessarily sorted by their *x* coordinate.

Output

In the single line print "yes" (without the quotes), if the line has self-intersections. Otherwise, print "no" (without the quotes).

Examples

Input

4

0 10 5 15

Output

yes

Input

4

0 15 5 10

Output

no

Note

The first test from the statement is on the picture to the left, the second test is on the picture to the right.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/26/2017 12:22:11 (c2).

Desktop version, switch to mobile version.
User lists

Name |
---|