#include <iostream>
typedef long long ll;

int main() {
    // want y mod y-x to equal gcd(x, y)
    // y = d + k(y-x)
    // kx+d ky+d
    // y' = 1 + k(y' - x')
    // kx' + 1 = (k-1)y'
    // (mod k-1) x' == -1
    // (k-1)a + 1, ka+1
    // #(r, k, a) s.t. r(ka + 1) <= n given r, k, a > 0
    // now just do it block by block
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    int q;
    std::cin >> q;
    while (q--) {
        int n;
        ll cnt = 0;
        std::cin >> n;
        // one-line possible >=<
        for (ll i = 1; i <= n; i = 1 + n/(n/i)) for (ll j = 1;
         j <= n/i - 1; j = 1 + (n/i - 1) / ((n/i - 1) / j)) cnt += (1 + 
         (n / (n/i)) - i) * ((1 + (n/i - 1)/((n/i - 1)/j) - j) * ((n/i - 1)/j));
        std::cout << cnt << "\n";
    }
}