A city relay race hands out bib numbers 1 through n to its n registered runners, one number per runner, with no gaps and no repeats when everything goes right. This year the bib-printing machine jammed partway through: it printed one bib number twice (so two different runners ended up wearing the same number) and, because the machine only prints n stubs total, one bib number from 1 to n was never printed at all.

You are given the ledger of n bib numbers exactly as recorded from the printed stubs, in no particular order. Exactly one value in the ledger appears twice, and exactly one value from 1 to n is absent from the ledger. Report which bib number was duplicated and which bib number is missing.

Input format

Line 1: an integer n. Line 2: n space-separated integers, the recorded bib numbers.

Output format

Print two space-separated integers: the duplicated bib number, then the missing bib number.

Constraints

• 2 <= n <= 100000
• Every value in the ledger is between 1 and n, inclusive.
• Exactly one value appears exactly twice; exactly one value from 1..n appears zero times; every other value appears exactly once.

4
1 2 2 4

2 3

2
1 1

1 2