AT_abc390_a [ABC390A] 12435

You are given an integer sequence $ A=(A_1,A_2,A_3,A_4,A_5) $ obtained by permuting $ (1,2,3,4,5) $ . Determine whether $ A $ can be sorted in ascending order by performing **exactly one** operation of swapping two adjacent elements in $ A $ .

The input is given from Standard Input in the following format: > $ A_1 $ $ A_2 $ $ A_3 $ $ A_4 $ $ A_5 $

If $ A $ can be sorted in ascending order by exactly one operation, print `Yes`; otherwise, print `No`.

### Sample Explanation 1 By swapping $ A_3 $ and $ A_4 $ , $ A $ becomes $ (1,2,3,4,5) $ , so it can be sorted in ascending order. Therefore, print `Yes`. ### Sample Explanation 2 No matter what operation is performed, it is impossible to sort $ A $ in ascending order. ### Sample Explanation 3 You must perform exactly one operation. ### Constraints - $ A $ is an integer sequence of length $ 5 $ obtained by permuting $ (1,2,3,4,5) $ .