#include <iostream>
#include <cstring>

#define int long long
using namespace std;
const int N = 10000010;
const int INF = 1e18;
int f[N];
int w[3];

void init()
{
    memset(f, 0x3f, sizeof f);
    f[0] = 0;
    for (int i = 0; i < 3; i++) 
        for (int j = w[i]; j <= 10000000; j++)  // 只要时间复杂度允许，那就都可以拿下。
            f[j] = min(f[j], f[j - w[i]] + 1);  
}

signed main() 
{
    cin.tie(nullptr)->sync_with_stdio(false);
    w[0] = 7, w[1] = 31, w[2] = 365;
    init();
    int T;
    cin >> T;
    while (T--) 
    {
        int x;
        cin >> x;
        int t = x / 3650000;
        int res = t * 10000;
        x %= 3650000;
        if (f[x] > INF / 2) cout << "-1\n";
        else cout << res + f[x] << '\n';
    }
    return 0;
}