#include <stdio.h>

long sum[1000000009];
int prime[1000000009];

long findAns()
{
	long n = 1000000;
	long i = 0,j;
	long sum = 0;

	for(i = 2;i <= n;i++){
		if(prime[i] == 0){
			prime[i] = 1;
			for(j = 2;j*i <= n;j++){
				prime[j*i] = 1;
				sum[j*i] += i;

			}

		}
	}
	return 1;
}

int main()
{
	int T,n;
	long ans = 0;
	findAns();
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		if(n == 1)
			printf("1\n");
		else{
			ans = sum[n];
			ans += 1 + n;
			printf("%ld\n",ans);
		}
		
	}
	return 0;
}