import java.util.Scanner;

public class Main {

static Scanner sc = new Scanner(System.in);

static long f(long mid) {
    long t = (long) Math.sqrt(mid);
    return mid - t;
}

static void solve() {
    long k = sc.nextLong();
    long l = 1, r = (long) 5e18;
    long ans = 0;

    while (l <= r) {
        long mid = (l + r) / 2;
        if (f(mid) >= k) {
            ans = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }

    System.out.println(ans);
}

public static void main(String[] args) {

    int t = sc.nextInt();
    while (t-- > 0) {
        solve();
    }
    sc.close();
}

}