CHAMPU (A FRESHER) LOVES NUMBER TRICKS AND THOUGHT OF AN INTERESTING PROBLEM. HE GAVE THE PROBLEM TO YOU ALL AND ASKED YOU TO SOLVE IT.

YOU ARE GIVEN AN INTEGER $C$ .YOU HAVE TO FIND THE SMALLEST NUMBER $N$ SUCH THAT THERE EXIST A SET OF ANY $\lfloor N/2 \rfloor$ DISTINCT NUMBERS IN THE RANGE $[1, N]$ SUCH THAT THE SUM OF ELEMENTS OF SET IS ATLEAST $C$.

CONSTRAINTS
$1 \le C \le 10^{16}$
$1 \le T \le 10^4$

INPUT
FIRST LINE CONTAINS AN INTEGER $T$ (THE NUMBER OF TEST CASES).
NEXT $T$ LINES CONTAIN ONE INTEGER $C$

OUTPUT
PRINT $T$ LINES, EACH LINE CONTAINS THE ANSWER OF RESPECTIVE TEST CASE.