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 sys import stdin,stdout,setrecursionlimit
  from math import gcd,sqrt,factorial,pi,inf
  from collections import deque,defaultdict
  from bisect import bisect,bisect_left
  from time import time
  from itertools import permutations as per
  from heapq import heapify,heappush,heappop,heappushpop
  input=stdin.readline
  R=lambda:map(int,input().split())
  I=lambda:int(input())
  S=lambda:input().rstrip('\r\n')
  L=lambda:list(R())
  P=lambda x:stdout.write(str(x)+'\n')
  lcm=lambda x,y:(x*y)//gcd(x,y)
  nCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N
  inv=lambda x:pow(x,N-2,N)
  sumx=lambda x:(x**2+x)//2
  N=10**9+7
  
  def get(a):
      ans=0
      a=a[::-1]
      for i in range(0,len(a),k):
          ans+=a[i]
      return ans*2
  
  for _ in range(I()):
      n=I()
      if n%2:
          x=y=n//2
          x-=1
          y+=1
          if x%2:
              print(x,y,1)
          else:
              x-=1
              y+=1
              print(x,y,1)
      else:
          n-=1
          print(n//2,n//2+1,1)
  