|All-time Popular Problems|
|Check if subtree|
|Delete Middle of Linked List|
|Given a linked list of 0s, 1s and 2s, sort it.|
|Count nodes of linked list|
|Delete N nodes after M nodes of a linked list|
|Check for Balanced Tree|
|Remove every k'th node|
|k largest elements|
|0 - 1 Knapsack Problem|
|Subarray with given sum|
Given a number N, you need to find if N is fibonacci-prime number or not. A fibonacci-prime is any number that is both a prime and a fibonacci number.
The first line of the input contains a single integer T, denoting the number of test cases. Then T testcases follow. Each testcase contains a single line of input denoting the value of N.
For each testcase, print 1 if N is a fibonacci-prime; print 0 if N is not a fibonacci-prime.