Binary Palindrome Check

Given an integer N, determine whether its binary representation is a palindrome.

Input:

The first line contains an integer 'T' representing the number of test cases. 
The next 'T' lines each contain a single integer 'N'.

Output:

For each test case, return true if the binary representation of the given integer is a palindrome; otherwise, return false.

Example:

Input:

T = 2
N = 5
N = 10

Output:

true
false

Explanation:

Binary representation of 5 is 101, which is a palindrome. Binary representation of 10 is 1010, which is not a palindrome.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 1018

Note: You are not required to print anything; it has already been taken care of. Just implement the function to return the answer.