#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=x;i>=y;i--)
using namespace std;
const int N=1e6+10;
const int mod=998244353;
#define int long long
int qmi(int a,int b){//mod别弄错了
    int res=1;
    for(;b;b>>=1,a=a*a%mod)
        if(b&1)res=res*a%mod;
    return res;
}
void solve() {
    int n;cin>>n;
    int ans=-1;
    per(i,n/365,n/365-400){
        if(i<0)continue;
        int rem=n-365*i;
        per(j,rem/31,rem/31-40){
            if(j<0 or (rem-j*31)%7!=0)continue;
            if(ans==-1)ans=i+j+(rem-j*31)/7;
            ans=min(ans,i+j+(rem-j*31)/7);
        }
    }
    cout<<ans<<"\n";
}
signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int tc = 1;
    cin >> tc;
    for (int i = 1; i <= tc; i++) {
        solve();
    }
}
//5
//14
//38
//55
//403
//996