AT_abc386_a [ABC386A] Full House 2

Description

There are four cards with integers $ A,B,C,D $ written on them. Determine whether a Full House can be formed by adding one card. A set of five cards is called a Full House if and only if the following condition is satisfied: - For two distinct integers $ x $ and $ y $ , there are three cards with $ x $ written on them and two cards with $ y $ written on them.

Input Format

The input is given from Standard Input in the following format: > $ A $ $ B $ $ C $ $ D $

Output Format

If adding one card can form a Full House, print `Yes`; otherwise, print `No`.

Explanation/Hint

### Sample Explanation 1 Adding $ 1 $ to $ 7,7,7,1 $ forms a Full House. ### Sample Explanation 2 Adding anything to $ 13,12,11,10 $ does not form a Full House. ### Sample Explanation 3 Adding $ 3,3,5,5 $ to $ 3 $ forms a Full House. Also, adding $ 5 $ forms a Full House. ### Sample Explanation 4 Adding anything to $ 8,8,8,8 $ does not form a Full House. Note that five identical cards do not form a Full House. ### Constraints - All input values are integers. - $ 1 \le A,B,C,D \le 13 $