import math def comb(k, n): res = math.factorial(n) / math.factorial(k) / math.factorial(n - k) return res def brute_force(number_to_find): done = False current_row = 0 while not done: n = current_row + 1 for i in range(math.ceil(n / 2)): if number_to_find == comb(i, current_row): return n current_row += 1 return -1 if __name__ == '__main__': q = int(input()) for i in range(q): number_to_find = int(input()) result = brute_force(number_to_find) print(result)