/*
|----|   |----|
|    |   |    |
|    ----|    |
|             |
|    ----|    |
|    |   |    |
|----|   |----|

*/

#include <bits/stdc++.h>
#define int long long
#define fastio ios::sync_with_stdio(0), cin.tie(0)

using namespace std;

const int inf = 1e18;
const int N = 1e6;
vector<int> dp(N, inf);
int x[] = {7, 31, 365};

void solve()
{
    int n;
    cin >> n;
    dp[0] = 0;
    for(int i = 0; i < 3; i++) {
        for(int j = 0; j < N; j++) {
            if(j - x[i] >= 0) dp[j] = min(dp[j], dp[j - x[i]] + 1);
        }
    }
    while(n--) {
        int now = 0;
        cin >> now;
        // 處理now < N的狀況
        if(now < N) {
            cout << (dp[now] == inf ? -1 : dp[now]) << '\n';
        }
        else {
            int tmp = now - N;
            tmp = (tmp % 365 == 0 ? tmp / 365 : tmp / 365 + 1);
            int after = now - tmp * 365;
            cout << (dp[after] == inf ? -1 : tmp + dp[after]) << '\n';
        }
    }
    return;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}