Problem Statement

A Kadomatsu sequence is a sequence of $3$ elements $A_1, A_2, A_3$ that satisfies the following 2 conditions.

• $A_1, A_2, A_3$ are all distinct
• Among the $3$ elements, $A_2$ is the largest or $A_2$ is the smallest

When a sequence $A_1, A_2, A_3$ is a Kadomatsu sequence and $A_1 < A_3$, it is called an increasing Kadomatsu sequence.
Also, when all contiguous subsequences of length $3$ of a sequence $ A = A_1, A_2, ... , A_n $ of length $n$ are increasing Kadomatsu sequences, the sequence $A$ is called an increasing Kadomatsu sequence chain.
A contiguous subsequence of length $3$ means $A_i, A_{i+1}, A_{i+2}$ $(1 \leq i \leq n-2)$.

Koyumeishi is planning to hold a competitive programming contest themed on Kadomatsu sequences.
He has created $7$ problems in total, and since the theme is Kadomatsu sequences, he thought the order of the problems should also be related to Kadomatsu sequences.
Participants would be startled if very difficult problems came early on, so it seems good to arrange the problems so that their difficulties form an increasing Kadomatsu sequence chain.
Oh, but wait. Depending on the distribution of the problems' difficulties, it may be impossible to form an increasing Kadomatsu sequence chain... What a problem.

Given the difficulties of the 7 problems, determine whether they can be arranged in the order of an increasing Kadomatsu sequence chain.
Print "YES" if possible, and "NO" if impossible.

Input

$D_1$ $D_2$ $D_3$ $D_4$ $D_5$ $D_6$ $D_7$

The difficulties of the 7 problems are given separated by spaces.
The input values are integers satisfying $1 \leq D_k \leq 100$.

Output

Print "YES" if they can be arranged into an increasing Kadomatsu sequence chain, and "NO" if impossible.

Sample

1 2 3 4 5 6 7

YES

1 1 1 1 1 1 1

NO

1 2 2 3 3 4 5

YES