#include <cstdio>
#include <iostream>
#include <set>
#include <climits>
#include <map>
#include <algorithm>
#include <list>
#include <vector>
#include <utility>
#include <cstdlib>
#include <iomanip>
#include <cstring>
#include <string>
#include <cmath>

using namespace std;

long long cit() {
    long long ans = 0;
    char c = getchar();
    bool neg = false;
    while (c < '0' || c > '9') {
        if (c == '-') {
            c = getchar();
            neg = true;
            break;
        }
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        ans = (ans << 3) + (ans << 1) + (c - '0');
        c = getchar();
    }
    return (neg) ? -ans : ans;
}

void afis(long long n, char d) {
    int l = 0;
    char c[20];
    if (n == 0) {
        putchar('0');
    }
    if (n < 0) {
        putchar('-');
        n = -n;
    }
    while (n > 0) {
        c[l++] = n % 10 + '0';
        n /= 10;
    }
    for (int i = l - 1; i >= 0; i--) {
        putchar(c[i]);
    }
    putchar(d);
}

int main() {
  //  freopen("tt.txt", "r", stdin);
    freopen("sum.in", "r", stdin);
    freopen("sum.out", "w", stdout);

  //  ios::sync_with_stdio(false);
   // cin.tie(0);

    int fi[100001];
    for (int i = 2; i <= 100000; i++) {
        fi[i] = i - 1;
    }
    fi[1] = 1;
    for (int i = 2; i + i <= 100000; i++) {
        for (int j = i + i; j <= 100000; j += i) {
            fi[j] -= fi[i];
        }
    }

    long long ans[100001];
    for (int i = 1; i <= 100000; i++) {
        ans[i] = (((long long)i * fi[i]) << 1);
    }

    int n = cit();
    for (int i = 1; i <= n; i++) {
        int x = cit();
        afis(fi[x], '\n');
    }

    return 0;
}