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: import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.Scanner;
  
  public class Main {
      public static long gcd(long a, long b) {
          if (b==0) return a;
          return gcd(b,a%b);
      }
      public static void main(String[] args) {
          try (Scanner scanner = new Scanner(System.in)) {
              long t;
              t = scanner.nextLong();
              while(t-->0){
                  long n,a,b,c;
                  n = scanner.nextLong();
                  if(n%2 == 0){
                      a=2;
                      b=n-3;
                      c=1;
                  }else{
                      for(a=2;true;a++){
                          if(gcd(a,n-1-a)==1){
                              b=n-1-a;break;
                          }
                      }
                      c=1;
                  }
                  System.out.println(a+" "+b+" "+c);
              }
          }
      }
  }