Gambling

Vitalik, a second-grade student, began studying computer science and decided to become a programmer. However, when he told his family about this decision, his older brother Lesha said that Vitalik could not become a programmer because his logical thinking was poorly developed. As proof, Lesha noted that Vitalik almost always loses to him in checkers.

Feeling hurt, Vitalik decided to train his logical thinking. He heard from Uncle Sasha, the janitor, that card games are suitable for this purpose. Therefore, Vitalik decided to start small by solving card problems. From Uncle Sasha, he learned about the card game "Poker." He hasn't mastered the game itself yet, but has started solving card-related problems, though not always successfully. Here's one of the problems Vitalik cannot solve:

A card combination in "Poker" is given. The combination consists of $5$ cards, with the following designations:

• joker — $0$

• deuce — $2$

• three — $3$

• ...

• ten — $10$

• jack — $11$

• queen — $12$

• king — $13$

• ace — $14$

There can be no more than $2$ jokers. A joker can replace any card's value.

Determine, based on the input, whether the given cards can form a 2+2 combination; in other words, whether there are two pairs among the cards such that:

• The values of the cards in each pair are the same,

• The values of the cards in the two different pairs are different.

Help the unfortunate second-grader solve this difficult problem, or else his older brother will laugh at him!