영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
(그림은 원문 저장소에서 볼 수 있습니다)
On a table there are a number of stacks of books. Each day, one book is taken from each stack. These books together form a new stack to the right of the others, see figure 1. If a stack becomes empty, the stacks are pushed together from the right. Since there is a finite number of books, sooner or later the same arrangement will recur. Your task is to write a program that asks for the initial arrangement and then determines how long it takes before a previously seen arrangement recurs.
| Day | Stack 1 | Stack 2 | Stack 3 | Stack 4 | Stack 5 | Stack 6 |
| 1 | 4 | 5 | 7 | |||
| 2 | 3 | 4 | 6 | 3 | ||
| 3 | 2 | 3 | 5 | 2 | 4 | |
| 4 | 1 | 2 | 4 | 1 | 3 | 5 |
| 5 | 1 | 3 | 2 | 4 | 6 | |
| 6 | 2 | 1 | 3 | 5 | 5 | |
| 7 | 1 | 2 | 4 | 4 | 5 | |
| 8 | 1 | 3 | 3 | 4 | 5 | |
| 9 | 2 | 2 | 3 | 4 | 5 | |
| 10 | 1 | 1 | 2 | 3 | 4 | 5 |
| 11 | 1 | 2 | 3 | 4 | 6 | |
| 12 | 1 | 2 | 3 | 5 | 5 | |
| 13 | 1 | 2 | 4 | 4 | 5 |
The table above shows how the number of books in the stacks varies over 13 days. It will take at most 100 days before a previously seen arrangement recurs.
Input
The first line of input contains the integer N (1 ≤ N ≤ 15), the number of book stacks.
The next line contains N integers, the number of books in each stack, left to right. The total number of books is at most 50.
Output
Print two integers: the two first days where the arrangement was repeated. The first day should be output first.
예제
예제 1
3 4 5 7
7 13