1617B - GCD Problem - CodeForces Solution

#include<bits/stdc++.h>
bool salom(long long x)
{
    for (int i = 2; i <= sqrt(x); i++)
    {
        if (x % i == 0)
        {
            return false;
        }
    }
        return true;
}
using namespace std;
void wrongontest2()
{
    int n,a;
    cin>>n;
    for (int i = 0; i < n; i++)
    {
        cin>>a;
        if (a % 2 == 0)
        {
            cout << 4 << " " << a - 5 << " " << 1 << endl;
        }
        else
        {
            if ((a/2) % 2 == 0)
            {
                cout << a / 2+1 << " " << a/2-1 << " " << 1 << endl;
            }
            else
            {
                cout << a / 2 + 2 << " " << a/ 2 - 2 << " " << 1 << endl;
            }
        }
    }
}
int main ()
{
    int t=1;
    //cin>>t;
    while(t--)
    {
      wrongontest2();
    }
}