the least common multiplier

#include <iostream>
using namespace std;
int gcd(int a,int b){
    int c=b%a;
    while(c>0){
        b=a;
        a=c;
        c=b%a;
    }
return a;
}

int main()
{
    int t;cin>>t;int n;
    while(t--){
        __int64 sum=0,i;
        cin>>n;
        for(i=n/2;i>0;i--){
            if(gcd(i,n-i)==1)
            {
                sum=i*(n-i);
                break;
            }
        }
        cout<<sum<<endl;
    }
 return 0;
}