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.*;
  import java.io.*;
   
  public class B {
  	
  	static FastScanner fs = new FastScanner();
  	static PrintWriter pw = new PrintWriter(System.out);
  	static StringBuilder sb = new StringBuilder("");
  	
  	public static void main(String[] args) {
  		int t = fs.nextInt();
  		for (int tt = 0; tt < t; tt++) {
  			int n = fs.nextInt();
  			for (int i = 2; true; i++) {
  				if (gcd(i, n-1-i) != 1) continue;
  				sb.append(n-1-i + " " + i + " " + 1 + "\n");
  				if (n-1-i <= 1) throw null;
  				break;
  			}
  		}
  		pw.print(sb.toString());
  		pw.close();
  	}
  	
  	static int gcd(int a, int b) {
  		if (b == 0) return a;
  		return gcd(b, a%b);
  	}
   
  	static class FastScanner {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  		String next() {while (!st.hasMoreTokens())try {st = new StringTokenizer(br.readLine());} catch (IOException e) {}return st.nextToken();}
  		int nextInt() {return Integer.parseInt(next());}
  		long nextLong() {return Long.parseLong(next());}
  		double nextDouble() {return Double.parseDouble(next());}
  		int[] readArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) {a[i] = nextInt();} return a;}
  	}
  }