Solve the programming task below in a Python markdown code block.
The palindrome is a string that can be read the same way from left to right and from right to left. For example, strings "aaaaa", "1221", "bbaabb" are palindromes, however the string "chef" is not a palindrome because if we read it from right to left, we will obtain "fehc" that is not the same as "chef".

We call a string a "double string" if it has an even length and the first half of this string is equal to the second half of this string, for example "abab" is a double string because the first half "ab" is equal to the second half "ab", however the string "abba" is not a double string because the first half "ab" is not equal to the second half "ba". The empty string "" is a double string, and its length is 0.

Chef doesn't like palindromes, however he likes "double strings". He often likes to change the order of letters in some palindrome and sometimes to remove some symbols from it. Now he wonders: if a palindrome of length N is given, what is the maximal possible number of characters in a "double string" 
that can be obtained by removing and changing the order of symbols in it?

------ Input ------ 

Several test cases are given.

The first line of the sample input contains an integer T - the number of test cases.

Then, T lines follow.

Each line consists of a single integer N - the length of a palindrome.

------ Output ------ 

For each test case output a single integer - answer to the problem.

------ Constraints ------ 

$1≤T≤10000$
$1≤N≤1000000000$

----- Sample Input 1 ------ 
2
2
4
----- Sample Output 1 ------ 
2
4