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.*;
  import java.util.Arrays;
  import java.util.StringTokenizer;
  
  /**
   * Accomplished using the EduTools plugin by JetBrains https://plugins.jetbrains.com/plugin/10081-edutools
   */
  
  
  public class Main {
     public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
     }
  
     public static class Task {
        private boolean[] notPrime;
  
        private void init() {
           notPrime = new boolean[1000002];
           for(int i=2;i<=1000001;i++) {
              for(int j=2;j*i<=1000001;j++) {
                 notPrime[i*j] = true;
              }
           }
        }
  
        public void solve(int cnt, InputReader in, PrintWriter out) {
           cnt = in.nextInt();
           for(int cc=0;cc<cnt;cc++) {
              int n = in.nextInt();
              int x = n-1;
              if(x%2==1) {
                 out.print((n-3)+" "+(2)+" "+1);
              } else {
                 int y = x/2;
                 while (y%2==0 || y==n-1-y) y--;
                 out.print((y)+" "+(n-1-y)+" "+1);
              }
              out.println();
           }
        }
     }
  
     static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
  
        public InputReader(InputStream stream) {
           reader = new BufferedReader(new InputStreamReader(stream), 32768);
           tokenizer = null;
        }
  
        public String next() {
           while (tokenizer == null || !tokenizer.hasMoreTokens()) {
              try {
                 tokenizer = new StringTokenizer(reader.readLine());
              } catch (IOException e) {
                 throw new RuntimeException(e);
              }
           }
           return tokenizer.nextToken();
        }
  
        public int nextInt() {
           return Integer.parseInt(next());
        }
  
     }
  }