#include<iostream>
#include<string>
#include<stack>
#include<map>
#include<stdio.h>
#include<iostream>
#include<string>
#include<stack>
#include<map>
#include<stdio.h>
#include<queue>
#include<vector>
#include<algorithm>
#include<memory.h>
#include<set>
#include<cmath>
#include<math.h>
#include<iomanip>
using namespace std; 

int const N=5e6+5;
vector< int  >v;
long long  x,z,y,n,m,co=0;

int x1,x2,y2;

bool vis[N];
map<long long ,long long>mp;
int main()
{
	int t;
	cin>>t;
	while(t--){
		mp.clear();
	cin>>x;
	if(x==1)
	{	co++;continue;}
	
	//memset(vis,0,sizeof vis);
	double b=x;
	long long lol=sqrt(b);
	
	for(long long  i=2;i<=lol;i++)
	{
		//cout<<i<<" ";
	if(x%i==0)
	{
		mp[i]=true;
		mp[x/i]=true;

	}
	//se.insert(x);
	}
	
	co+=x;
	z=2;
	n=1;
	y=1;
while(n<x)
	{
	n=y*z;
	z++;
	//cout<<n<<" "<<y<<" "<<z<<endl;
	if(mp[n])
	{
	co+=x/n;
	z=2;
	y=n;
	//cout<<n<<"ff ";
	}

	}

	
	co++;
	
	}
	cout<<co<<endl;
  return 0;
}