#include <bits/stdc++.h>
using namespace std;
using ll = long long;

inline ll rd() {
    ll x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x; 
}

#define N 100007

int f[N];

inline void work() {
    ll x = rd();
    if (x < N) {printf("%d\n", f[x]); return;}
    ll t = (x - 100000 + 364) / 365;
    printf("%lld\n", f[x - t * 365] + t);
}

int main() {
    memset(f, 0x3f, sizeof(f));
    f[0] = 0;
    for (int v = 7; v < N; ++v) f[v] = min(f[v], f[v - 7] + 1);
    for (int v = 31; v < N; ++v) f[v] = min(f[v], f[v - 31] + 1);
    for (int v = 365; v < N; ++v) f[v] = min(f[v], f[v - 365] + 1);  
    for (int v = 1; v < N; ++v)
        if (f[v] > 1e9) f[v] = -1;  
    for (int t = rd(); t; --t) work();
    return 0;
}