#include using namespace std; using ll = long long; using ld = long double; using vl = vector; template using vc = vector; template using vvc = vector>; const ll MOD = 1e9 + 7; // const ll MOD = 998244353; const ll INF = 5e18; const ld EPS = 1e-11; const ld PI = acos(-1.0L); #define eb emplace_back #define all(x) (x).begin(), (x).end() #define rep(i, n) for (ll i = 0; i < (n); i++) #define repr(i, n) for (ll i = (n)-1; i >= 0; i--) #define repe(i, l, r) for (ll i = (l); i < (r); i++) #define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--) template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b void verr(const T& a, const N& n) { rep(i, n) cout << a[i] << " "; cout << "\n"; } ll dbgt = 1; void err() { cout << "passed " << dbgt++ << "\n"; } template void err(H&& h,T&&... t){ cout<< h << (sizeof...(t)?" ":"\n"); if(sizeof...(t)>0) err(forward(t)...); } #endif void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);} //--------------------------------------------------------------------------------// int main() { init(); ll t; cin >> t; while(t--){ ll N; cin >> N; ll ans = N * (2 * N - 1); repe(a,2,(ll)sqrt(N)+1){ ll c = a * a, cp = 2; while(c <= N){ repe(b,1,cp){ if (gcd(b, cp) == 1) ans += (N / cp) * 2; } cp++, c *= a; } } cout << ans << endl; } }