Maximum splitting【CodeForces 870C】

Maximum splitting
求n最多能用多少个合数组成。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const int Max=1e5+10;
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        long long x,ans=0;
        scanf("%lld",&x);
        if(x<=3||x==5||x==7||x==11)
        {
            printf("-1\n");
            continue;
        }
        if(x%2==0)
        {
            if(x%4==0)
                printf("%lld\n",x/4);
            else printf("%lld\n",(x-6)/4+1);
        }
        else
        {
            x-=9;
            ans++;
            if(x%4==0)
                printf("%lld\n",ans+x/4);
            else printf("%lld\n",ans+1+(x-6)/4);
        }
    }
    return 0;
}