#include <iostream>
#include <map>
#include <algorithm>
#include <set>
#include <cstring>
#include <queue>
#define N 10000010
using namespace std;
#define int long long
#define INF 1000000000
int f[N];
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t, n;
    cin >> t;
    // memset(f,INF,sizeof(f));//
    for (int i = 0; i < N; i++)
    {
        f[i] = INF;
    }
    f[0] = 0;
    int v[3] = {7, 31, 365};
    for (int i = 0; i < 3; i++)
    {
        for (int j = v[i]; j <= 10000000; j++)
            f[j] = min(f[j], f[j - v[i]] + 1);
    }

    // cout<<f[7]<<"??"<<endl;
    while (t--)
    {
        cin >> n;
        int u = n / 79205;
        long long temp = 0;
        if (n > N)
            temp = (n - N) / 365 + 1;
        n -= temp * 365;
        int ans=temp + f[n];
        if(ans>=INF){
        	cout<<"-1"<<endl;
		} else{
			cout<<temp + f[n]<<endl;
		}
    }
    return 0;
}