A15330 | Fibonacci Strings

In all schools in Buryatia, in the $1$ class, everyone is told the theory of Fibonacci strings.

"A block is a subsegment of a string where all the letters are the same and are bounded on the left and right by the ends of the string or by letters other than the letters in the block. A string is called a Fibonacci string if, when it is divided into blocks, their lengths in the order they appear in the string form the Fibonacci sequence ( $f_0 = f_1 = 1$ , $f_i = f_{i-2} + f_{i-1}$ ), starting from the zeroth member of this sequence. A string is called semi-Fibonacci if it possible to reorder its letters to get a Fibonacci string."

Burenka decided to enter the Buryat State University, but at the entrance exam she was given a difficult task. She was given a string consisting of the letters of the Buryat alphabet (which contains exactly $k$ letters), and was asked if the given string is semi-Fibonacci. The string can be very long, so instead of the string, she was given the number of appearances of each letter ( $c_i$ for the $i$ -th letter) in that string. Unfortunately, Burenka no longer remembers the theory of Fibonacci strings, so without your help she will not pass the exam.

The first line contains one integer $t$ ( $1 \leq t \leq 10^4$ ) — the number of test cases. The following is a description of the input data sets.

The first line of each test case contains one integer $k$ ( $1 \leq k \leq 100$ ) — the number of letters in the alphabet.

The second line of each test case contains $k$ integers $c_1, c_2, \ldots, c_k$ ( $1 \leq c_i \leq 10^9$ ) — the number of occurrences of each letter in the string.

For each test case print the string "YES" if the corresponding string is semi-Fibonacci, and "NO" if it is not.

You can print "YES" and "NO" in any case (for example, the strings "yEs", "yes", "Yes" will be recognized as a positive answer).