#include <bits/stdc++.h>
#define db(x) cerr<<#x<<" "<<(x)<<"\n" 
#define db1(x) cerr<<#x<<" "<<(x)<<" "
#define rep(i,a,b) for(int i=a;i<=b;i++) 
#define ll long long
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define all(v) v.begin(),v.end()
using namespace std;
using pii = pair<int,int>;
const int N = 2e5+10;
int n,m;
vector<int> fac;
void solve()
{
	cin>>n;
	for(int i=1;i*i<=n;i++)if(n%i==0)fac.push_back(i),fac.push_back(n/i);
	sort(all(fac));
	ll ans=0;
	//cout<<fac.size()<<"\n";
	for(int i=0;i<fac.size()-1;i++){
	//	db(fac[i]);
		ans = ans + n/fac[i]*(fac[i+1]-fac[i]);
	}
	ans++;
	cout<<ans<<"\n";
	fac.clear();
	return ;
}
int main()
{
	int _;cin>>_;
	while(_--)solve();
	return 0;
}