Submit solution

Points:
5

Time limit:
2.0s

Memory limit:
64M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

##### DWITE Online Computer Programming Contest, October 2009, Problem 3

You have a continuous sequence of unique numbers, , that you like very much, but your little sister always steals one (and only one), and randomly re-arranges the rest in an attempt to hide the crime. Given numbers, in a random order, find out which number was taken.

The input will contain 5 sets of input. The first line will be an integer , the number of items remaining. Followed by lines of unique integers, from at least to at most .

The output will contain 5 lines, each an integer from the missing set.

*Note: the original sorted sequence is . Any of the numbers (including or ) can be taken.*

#### Sample Input

```
2
1
2
2
2
3
2
1
3
```

#### Sample Output

```
3
1
2
```

## Comments

The question states there will be 5 sets of input, but in the example there are only 3?