#include <bits/stdc++.h>
using namespace std;
using lint = long long;

template<typename T>
vector<pair<T, int>> factorize(T n) {
  vector<pair<T, int>> res;
  for (T i = 2; i*i <= n; i++) {
    if (n%i == 0) {
      int cnt = 0;
      while (n%i == 0) cnt++, n/=i;
      res.emplace_back(make_pair(i, cnt));
    }
  }
  if (n != 1) res.emplace_back(make_pair(n, 1));
  return res;
}

void solve(lint n) {
  vector<pair<lint, int>> vec = factorize(n);
  if (vec.size() == 1 && vec[0].first == 2) {
    cout << 3LL*(n/4) << " " << 4LL*(n/4) << " " << 5LL*(n/4) << endl;
  }
  else {
    lint p = vec[0].first;
    if (p == 2) p = vec[1].first;
    cout << (p*p/2)*(n/p) << " " << p*(n/p) << " " << (p*p/2+1)*(n/p) << endl;
  }
}

int main() {
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    lint l;
    cin >> l;
    solve(l);
  }
}