ENG  RUSTimus Online Judge
Online Judge
Online contests
About Online Judge
Frequently asked questions
Site news
Problem set
Submit solution
Judge status
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests

Ural Regional School Programming Contest 2014

About     Problems     Submit solution     Judge status     Standings
Contest is over

H. Overturned Numbers

Time limit: 1.0 second
Memory limit: 64 MB
Little Pierre was surfing the Internet and came across an interesting puzzle:
Problem illustration
What is the number under the car?
It took some time before Pierre solved the puzzle, but eventually he understood that there were overturned numbers 86, 88, 89, 90, and 91 in the picture and the answer was the number 87.
Now Pierre wants to entertain his friends with similar puzzles. He wants to construct a sequence of n numbers such that its overturning produces a consecutive segment of the positive integers. Pierre intends to use one-digit integers supplemented with a leading zero and two-digit integers only. To avoid ambiguity, note that when the digits 0, 1, and 8 are overturned, they remain the same, the digits 6 and 9 are converted into each other, and the remaining digits become unreadable symbols.


The only line contains the number n of integers in a sequence (1 ≤ n ≤ 99).


If there is no sequence of length n with the above property, output “Glupenky Pierre” (“Silly Pierre” in Russian). Otherwise, output any of such sequences. The numbers in the sequence should be separated with a space.


11 01
Glupenky Pierre
Problem Author: Nikita Sivukhin
Problem Source: Ural Regional School Programming Contest 2014
To submit the solution for this problem go to the Problem set: 2031. Overturned Numbers