Given an array with positive number the task to find the largest subsequence from array that contain elements which are Fibonacci numbers.
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer N denoting the size of the array. Then in the next line are N space separated values of the array.
For each test case in a new line print the space separated elements of the longest fibonacci subsequence.