영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
(그림은 원문 저장소에서 볼 수 있습니다)
On the top track (called the input track) there is a train with n cars, numbered from 1 to n starting from the front car. On the lower track (called the output track) you see the same cars in the desired order as the train leaves the switching area.
The order of the cars can be changed by pushing them onto the siding (which is long enough to hold all cars at once). Only two movements are allowed:
- The first car on the input track to the last position on the siding
- The last car on the siding to the last position on the output track
Write a program that receives the desired order on the output track and determines whether this order is possible to achieve. The order of the n cars on the input track is always in ascending numerical order from first to last car.
Input
The first line of input contains the integer n (1 ≤ n ≤ 100), the number of train cars.
The next line contains the integers g_1, g_2, …, g_n (1 ≤ g_i ≤ n), the desired order of the cars. It is guaranteed that all g_i are unique.
Output
If it is possible to reach the desired arrangement, print JA. Otherwise, print NEJ.
예제
예제 1
5 2 4 3 5 1
JA
예제 2
5 5 4 1 2 3
NEJ