A11216 | Fair Game

Petya and Vasya decided to play a game. They have $n$ cards ( $n$ is an even number). A single integer is written on each card.

Before the game Petya will choose an integer and after that Vasya will choose another integer (different from the number that Petya chose). During the game each player takes all the cards with number he chose. For example, if Petya chose number $5$ before the game he will take all cards on which $5$ is written and if Vasya chose number $10$ before the game he will take all cards on which $10$ is written.

The game is considered fair if Petya and Vasya can take all $n$ cards, and the number of cards each player gets is the same.

Determine whether Petya and Vasya can choose integer numbers before the game so that the game is fair.

The first line contains a single integer $n$ ( $2<=n<=100$ ) — number of cards. It is guaranteed that $n$ is an even number.

The following $n$ lines contain a sequence of integers $a_{1},a_{2},...,a_{n}$ (one integer per line, $1<=a_{i}<=100$ ) — numbers written on the $n$ cards.

If it is impossible for Petya and Vasya to choose numbers in such a way that the game will be fair, print "NO" (without quotes) in the first line. In this case you should not print anything more.

In the other case print "YES" (without quotes) in the first line. In the second line print two distinct integers — number that Petya should choose and the number that Vasya should choose to make the game fair. If there are several solutions, print any of them.