#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T, class F, std::enable_if_t<std::is_integral_v<T>>* = nullptr>
T binary_search(T ok, T ng, const F& f) {
    using U = std::make_unsigned_t<T>;
    assert(ok != ng);
    if (ok < ng) {
        while (ok + 1 != ng) {
            const T md = ok + T((U(ng) - U(ok)) >> 1);
            (f(md) ? ok : ng) = md;
        }
    } else {
        while (ng + 1 != ok) {
            const T md = ng + T((U(ok) - U(ng)) >> 1);
            (f(md) ? ok : ng) = md;
        }
    }
    return ok;
}

template <class T> using Vec = std::vector<T>;

void main_() {
    u64 N;
    std::cin >> N;
    std::cout << binary_search<u64>(0, N + 1, [&](const u64 x) { return x <= N / x; }) << '\n';
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    usize cases;
    std::cin >> cases;
    while (cases--) main_();
    return 0;
}