CF864A.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.

佩佳和瓦夏决定玩一个游戏。他们有 $n$ 张卡片（$n$ 为偶数），每张卡片上写有一个整数。

游戏开始前，佩佳先选择一个整数，随后瓦夏再选择另一个整数（该整数必须不同于佩佳所选的数）。游戏过程中，每位玩家取走所有写有自己所选数字的卡片。例如，若佩佳事先选择了数字 $5$，则他将取走所有写有 $5$ 的卡片；若瓦夏事先选择了数字 $10$，则他将取走所有写有 $10$ 的卡片。

当且仅当佩佳和瓦夏能够取走全部 $n$ 张卡片，且每人恰好获得相同数量的卡片时，该游戏被认为是公平的。

请判断：佩佳和瓦夏能否在游戏开始前分别选择整数，使得游戏是公平的？

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.

第一行包含一个整数 $n$（$2 \leq n \leq 100$）—— 卡片的数量。保证 $n$ 是偶数。

接下来的 $n$ 行包含一个整数序列 $a_1,\,a_2,\,\dots,\,a_n$（每行一个整数，$1 \leq a_i \leq 100$）—— 写在 $n$ 张卡片上的数字。

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.

如果彼得和瓦夏无法选择数字使得游戏公平，则在第一行输出 "NO"（不带引号）。此时不应再输出任何其他内容。

否则，在第一行输出 "YES"（不带引号）；在第二行输出两个不同的整数——彼得应选择的数字和瓦夏应选择的数字，使得游戏公平。若存在多种解，输出任意一种即可。

In the first example the game will be fair if, for example, Petya chooses number 11, and Vasya chooses number 27. Then the will take all cards — Petya will take cards 1 and 4, and Vasya will take cards 2 and 3. Thus, each of them will take exactly two cards.

In the second example fair game is impossible because the numbers written on the cards are equal, but the numbers that Petya and Vasya should choose should be distinct.

In the third example it is impossible to take all cards. Petya and Vasya can take at most five cards — for example, Petya can choose number 10 and Vasya can choose number 20. But for the game to be fair it is necessary to take 6 cards.

在第一个例子中，若佩佳选择数字 $11$，瓦夏选择数字 $27$，则游戏将是公平的。此时，他们将取走所有卡片：佩佳取走编号为 $1$ 和 $4$ 的卡片，瓦夏取走编号为 $2$ 和 $3$ 的卡片。因此，他们每人恰好各取走两张卡片。

在第二个例子中，不可能实现公平游戏，因为卡片上所写的数字相等，但佩佳和瓦夏所选择的数字必须互不相同。

在第三个例子中，不可能取走所有卡片。佩佳和瓦夏最多只能取走五张卡片——例如，佩佳可选择数字 $10$，瓦夏可选择数字 $20$。但要使游戏公平，必须取走 $6$ 张卡片。