codeforce440C-Maximum splitting-规律题

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iterator>
#include <cmath>
using namespace std;

typedef long long ll;


int n,k;
ll x;

int main(){
    
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
    {
        scanf("%lld", &x);
        int ans = x/4;
        int tmp = x%4;
        if(x==1||x==2||x==3||x==5||x==7||x==11)
        {
            puts("-1");
            continue;
        }
        if(tmp==3||tmp==1)ans--;
        printf("%d\n",ans);
    }
    return 0;
}