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.util.ArrayList;
  import java.util.Scanner;
  
  /**
   *
   * @author Acer
   */
  public class GCD_Problem {
      
      public static void main(String[] args) {
          ArrayList<Integer> prime = new ArrayList<>();
          prime.add(2);
          for (int i = 3; i <= 1000001; i++) {
              boolean flag = true;
              for (int j = 2; j*j <= i; j++) {
                  if(i%j == 0){
                      flag = false;
                      break;
                  }
              }
              if(flag){
                  prime.add(i);
              }
          }
          Scanner sc = new Scanner(System.in);
          int T = sc.nextInt();
          while(T-- > 0){
              int n = sc.nextInt();
              if(n%2 == 0){
                  int c = 1;
                  n--;
                  int b = n/2;
                  int a = b+1;
                  System.out.println(a+" "+b+" "+c);
              }
              else{
                  int c = 1;
                  n--;
                  int b = 0;
                  int a = 0;
                  for (int i = 0; i < prime.size(); i++) {
                      if((n-prime.get(i))%prime.get(i) != 0){
                          b = prime.get(i);
                          a = n-prime.get(i);
                          break;
                      }
                  }
                  System.out.println(a+" "+b+" "+c);
              }
          }
      }
      
  }