Codeforces864A-Fair Game

最新推荐文章于 2020-05-23 18:37:51 发布

原创最新推荐文章于 2020-05-23 18:37:51 发布 · 487 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#CodeForces #864 #A

OI 专栏收录该内容

222 篇文章

订阅专栏

本文探讨了一个公平游戏的实现策略，即两个玩家如何选择数字来确保游戏的公平性。通过输入一组数字，判断是否能分成两组数量相等的子集，并输出可行方案或否定结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Input

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₁, a₂, ..., a_n (one integer per line, 1 ≤ a_i ≤ 100) — numbers written on the n cards.

Output

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.

Example

Input

Output

YES
11 27

Input

2
6
6

Output

NO

Input

Output

NO

Input

Output

NO

Note

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 1and 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.

题意：若n个数中有且只有2种不同的个数相同的数。则输出‘YES'，并输出这两个数，否则输出’NO'。比较简单，模拟求解。

Code：

var
  n,i,x,t,y,k,p:longint;
  a:array[1..100] of longint;
begin
  readln(n);
  for i:=1 to n do
  begin
    readln(x);
    inc(a[x]);
    if a[x]=1 then inc(t);
  end;
  x:=0;
  if t<>2 then writeln('NO') else
  begin
    for i:=1 to 100 do
      if a[i]>0 then
      begin
        if x=0 then
        begin
          x:=a[i];k:=i;
        end else
        begin
          y:=a[i];p:=i;
        end;
      end;
    if x=y then
    begin
      writeln('YES');
      writeln(k,' ',p);
    end else writeln('NO');
  end;
end.