#include<bits/stdc++.h>
#define gt getchar
#define pt putchar
#define fst first
#define scd second
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;
inline bool __(char ch){return ch>=48&&ch<=57;}
template<class T> inline void read(T &x){
	x=0;bool sgn=0;char ch=gt();
	while(!__(ch)&&ch!=EOF) sgn|=(ch=='-'),ch=gt();
	while(__(ch)) x=(x<<1)+(x<<3)+(ch&15),ch=gt();
	if(sgn) x=-x;
}
template<class T,class ...T1> inline void read(T &x,T1 &...x1){
	read(x);
	read(x1...);
}
template<class T> inline void print(T x){
	static char st[70];short top=0;
	if(x<0) pt('-');
 	do{st[++top]=x>=0?(x%10+48):(-(x%10)+48),x/=10;}while(x);
    while(top) pt(st[top--]);
}
template<class T> inline void printsp(T x){
	print(x);
	putchar(' ');
}
template<class T> inline void println(T x){
	print(x);
	putchar('\n');
}
int main(){
	int T;read(T);
	while(T--){
		int n;read(n);
		if(n==1){
			cout<<1<<endl;
			continue;
		}
		vector<int>vec;vec.clear(); 
		for(int i=1;i*i<=n;i++){
			if(n%i==0){
				vec.push_back(i);
				if(i!=n/i)vec.push_back(n/i);
			}
		}
		sort(vec.begin(),vec.end());
		ll ans=0;
		for(int i=1;i<vec.size();i++){
			ans+=n/vec[i-1]*(vec[i]-vec[i-1]);
		}
		ans+=1;
		println(ans);
	}
	return 0;
}