NPY and arithmetic progression

NPY is learning arithmetic progression in his math class. In mathematics, an arithmetic progression (AP) is a sequence of numbers such that the difference between the consecutive terms is constant.(from wikipedia)
He thinks it's easy to understand,and he found a challenging problem from his talented math teacher:
You're given four integers, $a_1, a_2, a_3, a_4$, which are the numbers of 1,2,3,4 you have.Can you divide these numbers into some Arithmetic Progressions,whose lengths are equal to or greater than 3?(i.e.The number of AP can be one)
Attention: You must use every number exactly once.
Can you solve this problem?

The first line contains a integer T — the number of test cases ($1 \leq T \leq 100000$).
The next T lines,each contains 4 integers $a_1, a_2, a_3, a_4(0 \leq a_1, a_2, a_3, a_4 \leq 10^9)$.

For each test case,print "Yes"(without quotes) if the numbers can be divided properly,otherwise print "No"(without quotes).

3
1 2 2 1
1 0 0 0
3 0 0 0

Yes
No
Yes

In the first case,the numbers can be divided into {1,2,3} and {2,3,4}.
In the second case,the numbers can't be divided properly.
In the third case,the numbers can be divided into {1,1,1}.

BestCoder Round #22