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.Random;
  import java.util.StringTokenizer;
  
  public class B {
      static FastScanner fs = new FastScanner(System.in);
      static PrintWriter pw = new PrintWriter(System.out);
      static long mod = (long) 1e9 + 7;
  
      public static void main(String[] args) throws Exception {
          int n = fs.nextInt();
          for(int i = 0; i < n; i++) solve();
          pw.flush();
      }
      public static void solve() {
          int n = fs.nextInt();
          n--;
          for(int i = n / 2; i >=1; i--) {
              if(gcd(i, n - i) == 1) {
                  pw.print(i + " " + (n - i) + " ");
                  break;
              }
          }
          pw.print(1);
          pw.println();
      }
  
      public static int gcd(int a, int b) {
          return a == 0 ? b : gcd(b % a, a);
      }
  
      static class GeekInteger {
          public static void save_sort(int[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static int[] shuffle(int[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  int randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
          public static void save_sort(long[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static long[] shuffle(long[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  long randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
      }
      static class FastScanner {
          private BufferedReader reader = null;
          private StringTokenizer tokenizer = null;
  
          public FastScanner(InputStream in) {
              reader = new BufferedReader(new InputStreamReader(in));
              tokenizer = null;
          }
  
          public FastScanner(FileReader in) {
              reader = new BufferedReader(in);
              tokenizer = null;
          }
  
          public String next() {
              if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public String nextLine() {
              if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      return reader.readLine();
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken("\n");
          }
  
          public long nextLong() {
              return Long.parseLong(next());
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public double nextDouble() {
              return Double.parseDouble(next());
          }
  
          public String[] nextArray(int n) {
              String[] a = new String[n];
              for (int i = 0; i < n; i++)
                  a[i] = next();
              return a;
          }
  
          public int[] nextIntArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextInt();
              return a;
          }
  
          public long[] nextLongArray(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextLong();
              return a;
          }
      }
  }
  
  
  