You are given a grid of size 3*3 that has the following specifications:

Note:If Wesam is standing at cell (x,y), he can go to :(x+1,y) , (x-1,y), (x,y+1) , (x,y-1), (x+1,y+1) , (x-1,y-1).

Note: rows are numbered from top to down, and columns are numbered from left to right.

Write a program to find if Wesam can reach Omar or not.

Input format:

It's guaranteed that cell (1,1) and cell (3,3) are empty.

Output format:

For each test case print "YES" (without quotes) if Wesam can reach Omar. Print "NO" (without quotes) otherwise.

Constraints

1<= T <= 100