• [1285] The TT Candy

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • One day at night, Mr.Cai has a appointment with tt. When they get the menu, something happened that frozen the waiter. You want to know what happened? OK, let me tell you. When tt is looking at the menu, Mr.Cai said some interesting things, it makes tt laugh all the time.

    What Mr.Cai said?
    He said:"only you...", oh, no, no... not this.
    He said:"tt likes eating sweets, tt likes eating chocolates..."

    But tt do not like eating the same sweets, when she eats a grain of sweet A, then she can't eat sweet A, she can eats sweet B, and then eat sweet A.

    Now, there are many kinds of sweets, is there a way to eat all sweets?

  • 输入
  • There is a integer T means the number of teses.
    Then each test has a integer n (0 < n <= 100000), means there are n kinds of sweets. Then follows n integers next line, means the number of each kind of sweets. No integer will be more than 1000000.
  • 输出
  • If there is a way to eat all sweets, printf 'Yes', else 'No'.
  • 样例输入
  • 2
    4 1 1
    5 4 3 2 1
  • 样例输出
  • No
  • 提示
  • 来源
  • Hungar
  • 操作