In ancient times, people used ijo to refer to various kinds of scientific journals. However, we don't do that anymore. Ijo is now something legendary, that cannot be easily understood. However, you need to gather enough of it in order to get to the Sacred Ino.
Talb is really happy that he managed to get some ijo samples to present to the Big Jarab, but he needs to set aside which parts he missed on the way. In order to help him solve his issue, you are given a snapshot of his ijo samples as a non-decreasing sorted array containing values between 1 and 100.
You need to provide, in return, all gaps that he hasn't covered in the interval [1, 100]. You will provide the gaps as pairs of integers (A, B), separated by a dash, representing the fact that neither A, nor B or the integer values between A and B were covered in his ijo sample sequence. Note that each gap should be maximally extended.
Note: You will receive full feedback for your submissions.
The first line of the input contains N, the number of elements in the array.
Each of the following N lines contains an element of the array.
Print the gap intervals, in increasing order, each on a separate line.
If there are no gaps, please print All clear!
- 1 ≤ N ≤ 100
- The array is sorted!