#include <iostream>
#include <fstream>
#include <set>
#include <vector>
#include <list>
#include <queue>
#include <algorithm>

//merci pauldb de solutie :)

using namespace std;

ifstream f("sum.in");
ofstream g("sum.out");

long phi[100001], n;

int main()
{
	int i, j, a, b, c, x;
	long long nr = 1;
	f >> n;
	for (i = 1; i <= 100000; i++) phi[i] = i;

	for (i = 2; i <= 100000; i++)
		if (phi[i] == i)
			for (j = i; j <= 100000; j += i) phi[j] = phi[j] / i * (i - 1);

	for (i = 1; i <= n; i++) {
		f >> x;
		g << 2 * phi[x] * x << "\n";
	}

	return 0;
}