/* Problem URL: https://codeforces.com/contest/1829/problem/G */

#include <bits/stdc++.h>

using namespace std;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vl dp(1e6 + 1, 0);
    dp[1] = 1;

    vl stage(1e6 + 2, 0);
    ll now = 1;
    size_t cur = 1;
    for (size_t st = 1; cur < (size_t)1e6;) {
        for (; cur <= now && cur <= (size_t)1e6; cur++) {
            stage[cur] = st;
        }
        st++;
        now += st;
    }

    for (ll i = 2; i <= (int)1e6; i++) {
        dp[i] = i * i;
        if (stage[i - stage[i] + 1] != stage[i] - 1) {
            dp[i] += dp[i - stage[i]];
            continue;
        }
        if (stage[i - stage[i]] != stage[i] - 1) {
            dp[i] += dp[i - stage[i] + 1];
            continue;
        }

        dp[i] += dp[i - stage[i]] + dp[i - stage[i] + 1] - dp[i - (stage[i] - 1) * 2];
    }

    int t;
    cin >> t;
    while (t--) {
        ll n;
        cin >> n;

        cout << dp[n] << '\n';
    }
}