#include <map>

#include <set>

#include <list>

#include <cmath>

#include <ctime>

#include <deque>

#include <stack>

#include <queue>

#include <cctype>

#include <cstdio>

#include <string>

#include <vector>

#include <climits>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

#define LL long long

#define PI 3.1415926535897932626

using namespace std;

int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}

int phi[];

int ans[];

void calcu()

{

    memset(phi,,sizeof(phi));

    phi[] = ;

    for (int i = ; i <= ; i++)

        if (!phi[i])

      for (int j = i; j <= ; j += i)

      {

          if (!phi[j]) phi[j] = j;

          phi[j] = phi[j] / i * (i - );

      }

    ans[] = ;

    ans[] = ;

    for (int i = ; i <= ; i++)

        ans[i] = ans[i - ] + phi[i] * ;

}

int main()

{

    int kase = ;

    int T;

    calcu();

    scanf("%d",&T);

    while (T--)

    {

        int n;

        scanf("%d",&n);

        printf("%d %d %d\n",kase++,n,ans[n]);

    }

    return ;

}