description: Given a positive integer n. Find three distinct positive integers a, b, c such that a + b + c = n and \operatorname{gcd}(a, b) = c, where \operatorname{gcd}(x, y) denotes the [greatest common divisor (GCD)](https://en.wikipedia.org/wiki/Greatest_common_divisor) of integers x and y.
  
  Input
  
  The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 10^5) — the number of test cases. Description of the test cases follows.
  
  The first and only line of each test case contains a single integer n (10 ≤ n ≤ 10^9).
  
  Output
  
  For each test case, output three distinct positive integers a, b, c satisfying the requirements. If there are multiple solutions, you can print any. We can show that an answer always exists.
  
  Example
  
  Input
  
  
  6
  18
  63
  73
  91
  438
  122690412
  
  
  Output
  
  
  6 9 3
  21 39 3
  29 43 1
  49 35 7
  146 219 73
  28622 122661788 2
  
  Note
  
  In the first test case, 6 + 9 + 3 = 18 and \operatorname{gcd}(6, 9) = 3.
  
  In the second test case, 21 + 39 + 3 = 63 and \operatorname{gcd}(21, 39) = 3.
  
  In the third test case, 29 + 43 + 1 = 73 and \operatorname{gcd}(29, 43) = 1.
solution: 
  from math import gcd
  
  def checker(n, a, b, c):
      if (a+b+c) == n and gcd(a, b) == c:
          return 1
      return 0
  
  def solve(n):
      a,b,c = 0,0,0
      if n%2 == 0:
          c = 1
          a,b = n//2, n//2 - 1
      else:
          c = 1
          n -= 1
          g = n//2
          if g %2== 0:
              a = g-1
              b = g+1
          else:
              a = g-2
              b = g+2
      return a, b, c
  
  
  def verify(l, r):
      right, wrong = 0,0
      wrongs = []
      for i in range(l, r):
          a, b, c = solve(i)
          if checker(i, a, b, c):
              right+=1
          else:
              wrongs.append([i, a, b, c])
              wrong+=1
      print(f"Range {l}- {r}, Right : {right}, Wrong {wrong} ")
      for i, a, b, c in wrongs:
          print(f"For {i}, a={a}, b={b}, c={c} is wrong, gcd of a,b is {gcd(a, b)} , addition : {a+b+c}")
  
  def main():
      T = int(input())
      for t in range(T):
          n = int(input())
          print(*solve(n))
  
  main()