CK87QUER.cpp

#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
typedef long long ll;

#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define pb push_back

// unhackable custom hash for unordered_map
// Credits : neil
struct custom_hash {
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return x + FIXED_RANDOM;
	}
};

void solve() {
	ll y, ans = 0;
	cin >> y;
	ll lim = ll(sqrt(y - 1));
	if (y - (lim * lim) >= 700)
		ans = lim * 700;
	else {
		ll i;
		for (i = lim; i >= 1; i--) {
			if (y - (i * i) > 700)
				break;
			ans += (y - (i * i));
		}
		if (i != 1)
			ans += (700 * i);
	}
	cout << ans << "\n";
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	int t;
	cin >> t;
	while (t--)
		solve();
	return 0;
}