Missing Numbers

Interview

Time limit1sMemory limit1024 MB

Summary

Given an increasing list of distinct numbers a child recited, print every integer from 1 up to the last recited number that is missing, or print "good job" if none are.

Level: Easy2 of 10
Topics: Array, Implementation, Simulation, Brute force
Solved: No attempts yet

Problem

You enjoy your new job as a teacher of young children. It is fun to see them learning to count, recognize letters, draw, and interact with the world.

One common problem you have noticed is that children often forget numbers when counting. For example, early on they might count "one, two, three, five, six." You have to remind them about that "four" that they did not say. And as they get more proficient and clever, they may use the "quick" way of counting: "one, two, skip a few, ninety-nine, one hundred!"

Please write a program that can help you (and your students) identify the missing numbers when they are counting.

Input

The first line of input contains a single integer $n$ , where $1 \le n \le 100$ . Each of the next $n$ lines contains one number that the child recited. Each recited number is an integer between 1 and 200 (inclusive). They are listed in increasing order, and there are no duplicates.

Output

If the child recited all the numbers between 1 and the last number they recited, then print good job.

If the child missed any numbers between 1 and the last number they recited, then print those missing numbers in increasing numeric order, one per line.

Examples2

Example 1
Input
```
9
2
4
5
7
8
9
10
11
13
```
Expected output
```
1
3
6
12
```
Example 2
Input
```
5
1
2
3
4
5
```
Expected output
```
good job
```