#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#ifndef LOCAL
#define LOG(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <int, int> PII;

constexpr double EPS = 1e-8;
const double PI = acos(-1);

int multi_cases = 1;

constexpr int N = 7 * 31 * 365 * 2;
constexpr LL inf = 1e18;
int do_init = 0;
vector <LL> f(N + 5, inf);

void A_SOUL_AvA () {
    if (!do_init) {
        do_init = 1;
        f[7] = f[31] = f[365] = 1;
        vector <int> a = {7, 31, 365};
        for (int v : a) {
            for (int j = v; j <= N; j++) {
                f[j] = min(f[j], f[j - v] + 1);
            }
        }
    }

    LL n;
    cin >> n;

    LL k = N / 361;
    LL ans = 0;
    if (n <= N) {
        cout << (f[n] == inf ? -1 : f[n]) << endl;
    } else {
        LL x = (n + 360) / 361;
        assert(x >= k);
        ans += x - k;
        n -= (x - k) * 361;
        assert(n <= N);

        if (f[n] == inf) {
            cout << -1 << endl;
        } else {
            cout << ans + f[n] << endl;
        }
    }
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}