Vitalka second-graders began studying computer science and decided that would be a programmer. But once the house Vitalka said about his decision, as the elder brother Lesch said that the programmer from Vitalki not work, because it has a poorly developed logical thinking. And as an argument led to the incontrovertible fact that Vitalka almost always loses Loesche checkers. Vitalka very offended and decided to train your logical thinking. From janitor Uncle Sasha, he heard that the card games are appropriate for this purpose. Therefore Vitalka start small - began to solve problems on the maps. From the same Uncle Sasha Vitalka learned about a card game "Poker". Actually the game itself Vitalka not yet mastered, but have already begun to tackle problem gambling, although not always successfully. Here's one of the tasks with which Vitalka can not cope. Dana card combination in the game of "Poker". The combination consists of five cards, with the following notation: \begin{itemize} \item Joker - 0 \item Deuce - 2 \item Thry - 3 \item ... \item Ten - 10 \item Jack - 11 \item Lady - 12 \item King - 13 \item Ace - 14 \end{itemize} Jokers can be no more than two. The Joker can replace any card dignity. Incoming data is required to determine whether these maps form a combination of "2 +2", ie to determine whether there are among the cards have two pairs, such that * Value of the cards belonging to one pair of identical, * Value of the cards in different pairs are different. Help the unfortunate second-graders to solve this impossible task, or his older brother just laugh! \textbf{Input } In the input file lists the value of the cards. Numbers are separated by one or neskolkomi spaces. \textbf{Output} Display the word "Yes", if such a combination can make. Otherwise, give the word "No".