Problem Statement

There is a movie theater with $N$ seats numbered $1$ through $N$, and one customer is sitting in each seat. As a measure against congestion, this theater has customers leave according to the following rule.

• Divide the customers into groups of $10$ people each, in increasing order of the seat number they are sitting in.
• The groups leave in order, starting from the group consisting of customers with the smallest seat numbers. Customers within the same group may leave in any order.

Here, the last group may have fewer than $10$ customers.

The customer who left $i$-th was the one sitting in seat $P_i$. Determine whether the $N$ customers left according to the rule.

Constraints

• $10 \leq N \leq 100$
• $(P_1,P_2,\dots,P_N)$ is a permutation of $(1,2,\dots,N)$.
• All input values are integers.

Input

The input is given from Standard Input in the following format:

• $N$
• $P_1$ $P_2$ $\dots$ $P_N$

Output

Output Yes if the $N$ customers left according to the rule, and No otherwise, in one line.

25
1 6 5 7 8 10 2 4 3 9 15 17 12 11 19 20 18 13 14 16 21 23 24 22 25

Yes

The $25$ customers were divided into three groups, with seat numbers $1$ to $10$, $11$ to $20$, and $21$ to $25$. First, the $10$ customers in the first group, with seat numbers $1$ to $10$, left. Next, the $10$ customers in the second group, with seat numbers $11$ to $20$, left. Finally, the $5$ customers in the third group, with seat numbers $21$ to $25$, left. Thus, the $25$ customers left according to the rule.

11
11 10 7 2 1 5 6 4 8 9 3

No

• Source: AtCoder ABC 474 B