using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new long[t];
        for (var u = 0; u < t; ++u)
        {
            var n = NN;
            ans[u] = Shuffle(n);
        }
        WriteLine(string.Join("\n", ans));
    }
    static long Shuffle(int n)
    {
        if (n == 1) return 1;
        --n;
        var mod = 2 * n + 1;
        var max = 2 * n;
        var sq = (int)Math.Sqrt(max);
        var set = new HashSet<long>();
        var list = new List<long>();
        var tmp = 1L;
        var rev2 = ModInv(2, mod);
        for (var _ = 0; _ < sq; ++_)
        {
            set.Add(tmp);
            list.Add(tmp);
            tmp = tmp * rev2 % mod;
        }
        var i = 0;
        var ir = Exp(2, sq, mod);
        tmp = 1;
        while (true)
        {
            if (set.Contains(tmp))
            {
                for (var j = 0; j < sq; ++j)
                {
                    if (tmp == list[j] && (i != 0 || j != 0))
                    {
                        return i * sq + j;
                    }
                }
            }
            ++i;
            tmp = tmp * ir % mod;
        }
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
    // 拡張ユークリッド互除法 ax + by = gcd(a, b) を満たす x, y を求める
    public static (long g, long x, long y) XGcd(long a, long b)
    {
        long x0 = 1, y0 = 0, x1 = 0, y1 = 1;
        while (b != 0)
        {
            var q = a / b;
            var prevA = a;
            a = b;
            b = prevA % b;
            var prevX0 = x0;
            var prevY0 = y0;
            x0 = x1;
            x1 = prevX0 - q * x1;
            y0 = y1;
            y1 = prevY0 - q * y1;
        }
        return (a, x0, y0);
    }
    // a ^ -1 mod m を求める
    static int ModInv(int a, int mod)
    {
        var (_, x, _) = XGcd(a, mod);
        return (int)((x + mod) % mod);
    }
}