#include<bits/stdc++.h>
#define int long long
#define PII pair<int,int>
#define X first
#define Y second
const int INF=0x3f3f3f3f3f3f3f3f;
const int N=7*31*366;
const int M=7*31*365;
using namespace std;

int f[N];
void fun(){
	
	for(int i=0;i<N;i++)f[i]=INF;
	f[0]=0;
	int a[3]={7,31,365};
	//完全背包 
	for(int i=0;i<3;i++){
		for(int j=a[i];j<=M;j++){
			f[j]=min(f[j],f[j-a[i]]+1);
		}
	}
}

//考虑用背包来做 
void solve(){
	int n;
	cin>>n;
	if(n<=M){
		if(f[n]<INF)cout<<f[n]<<endl;
		else cout<<"-1"<<endl; 
	}else{
		
		int x=n-M;
		int ans=(x+364)/365;
		int y=n-365*ans;
		ans+=f[y];
		if(ans<INF)cout<<ans<<endl;
		else cout<<"-1"<<endl;
		
	}
	

}

signed main(){
	int T;
	T=1;
	fun();
	cin>>T;
	while(T--){
		solve();
	}
	return 0;
}