mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    def valuation(k):
        ret = 0
        while k % 2 == 0:
            ret += 1
            k //= 2
        return ret

    is_prime = [True] * 32001
    is_prime[0] = False
    is_prime[1] = False
    prime = []
    for i in range(2, 32001):
        if is_prime[i]:
            prime.append(i)
            for j in range(2, 32001):
                if i * j > 32000:
                    break
                is_prime[i*j] = False

    for _ in range(int(input())):
        N = int(input())
        s, m, NN = 0, 1, 2 * N - 1
        flg = 1
        for p in prime:
            if NN % p == 0:
                flg = 0
                break
        if flg:
            print(NN - 1)
            continue
        while True:
            k = NN + m
            v = valuation(k)
            s += v
            m = k >> v
            if m == 1:
                break
        print(s)


if __name__ == '__main__':
    main()