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 collections import *
  import sys
  import io, os
  import math
  from heapq import *
  gcd = math.gcd
  sqrt = math.sqrt
  def ceil(a, b):
      a = -a
      k = a // b
      k = -k
      return k
  # arr=list(map(int, input().split()))
  input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
  def strinp(testcases):
      k = 5
      if (testcases == -1 or testcases == 1):
          k = 1
      f = str(input())
      f = f[2:len(f) - k]
      return f
  
  def main():
      t=int(input())
      for _ in range(t):
          n=int(input())
          if(n%2==0):
              a=n//2
              print(a,a-1,1)
              continue
          k=n//2
          if(k%2):
              print(k-2,k+2,1)
              continue
          print(k-1,k+1,1)
  main()