B. GCD Problem(900分)

题目：

Given a positive integer nn. Find three distinct positive integers aa, bb, cc such that a+b+c=na+b+c=n and gcd(a,b)=cgcd⁡(a,b)=c, where gcd(x,y)gcd⁡(x,y) denotes the greatest common divisor (GCD) of integers xx and yy.

Input

The input consists of multiple test cases. The first line contains a single integer tt (1≤t≤1051≤t≤105) — the number of test cases. Description of the test cases follows.

The first and only line of each test case contains a single integer nn (10≤n≤10910≤n≤109).

Output

For each test case, output three distinct positive integers aa, bb, cc satisfying the requirements. If there are multiple solutions, you can print any. We can show that an answer always exists.

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&m);
        if(m%2!=0){
            int k=m/2;
            if(k%2==0){
                printf("%d %d 1\n",k-1,k+1);
            }
            else printf("%d %d 1\n",k-2,k+2);
        }
        else printf("%d %d 1\n",m/2-1,m/2);
    }
    return 0;
}