#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

int f(int a,int b)
{
	while(b>=2)
	{
		if(a%b==0) return a/b;
		b=b-1;
	}
	return a;
}

void solve()
{
	int n;
	cin>>n;
	int sum=0,num=0;
	for(int i=1;i<=n;i++)
	{
    	if(n%i==0) num = n/i;
    	sum+=num;
	}
	cout<<sum<<endl;
}

int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    cin >> tt;
    while(tt--) solve();
}