B'You are given some Tetris field consisting of n columns. The initial height of the i -th column of the field is a_i blocks. On top of these columns you can place only figures of size 2 x 1 (i.e. the height of this figure is 2 blocks and the width of this figure is 1 block). Note that you cannot rotate these figures. Your task is to say if you can clear the whole field by placing such figures. More formally, the problem can be described like this: The following process occurs while at least one a_i is greater than 0 : And your task is to determine if it is possible to clear the whole field (i.e. finish the described process), choosing the places for new figures properly. You have to answer t independent test cases. The first line of the input contains one integer t ( 1 <= t <= 100 ) -- the number of test cases. The next 2t lines describe test cases. The first line of the test case contains one integer n ( 1 <= n <= 100 ) -- the number of columns in the Tetris field. The second line of the test case contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 100 ), where a_i is the initial height of the i -th column of the Tetris field. For each test case, print the answer -- "YES" (without quotes) if you can clear the whole Tetris field and "NO" otherwise. The first test case of the example field is shown below: Gray lines are bounds of the Tetris field. Note that the field has no upper bound. One of the correct answers is to first place the figure in the first column. Then after the second step of the process, the field becomes [2, 0, 2] . Then place the figure in the second column and after the second step of the process, the field becomes [0, 0, 0] . And the second test case of the example field is shown below: It can be shown that you cannot do anything to end the process. In the third test case of the example, you first place th'...