Stepan and Matches
"'plaintext Stepan enjoys playing with matches, but not in a mischievous way. Instead of causing trouble or starting fires, he uses them to solve puzzles. For instance, he can transform the number nine into the number eleven by moving just one match.
Recently, Stepan's friends gave him several sets of twelve matches each. He started using these matches to create various geometric shapes. While he has already crafted many different shapes, he is now curious to find out which sets can be used to construct the frame of a parallelepiped using exactly twelve matches and some glue. The matches must remain intact, and none should stick out from the frame.
Your task is to determine, based on the lengths of the matches in each set, whether it is possible to assemble the frame of a parallelepiped.
Input
The first line contains a single integer N (1 ≤ N ≤ 100), representing the number of sets.
The next N lines each describe a set of matches, consisting of twelve positive integers, each not exceeding 10^9.
Output
Output N lines. For each set of matches, print “yes” if it's possible to construct the frame of a parallelepiped, and “no” otherwise. "'