Codeforces Round #781 (Div. 2) 1665 A. GCD vs LCM Solution

Problem Link:  https://codeforces.com/contest/1665/problem/A 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long  n,t;

    cin>>t;

    while(t--)

    {

        cin>>n;

        cout<<n-3<<" 1 1 1"<<endl;

    }

}