#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

int main() {
    int T;
    std::cin >> T;
    for(int i = 0; i < T; i++) {
        int n;
        std::cin >> n;
        std::vector<int> p;
        for(int j = 1; j <= 1000; j++) {
            int c = n*n + j*j;
            double C = sqrt(c);
            if(C == floor(C)) {
                int perimeter = static_cast<int>(C) + n + j;
                p.push_back(perimeter);
            }
        }
        if(p.empty()) {
            std::cout << -1 << std::endl;
        } else {
            std::cout << *max_element(p.begin(), p.end()) << std::endl;
        }
    }
    return 0;
}