#include<iostream>
#include<cstring>
#include<algorithm>
#include<set>
#define int long long
using namespace std;
const int N = 1e5,INF = 1e12;
void solve()
{
	int n;
	cin>>n;
	int tmp = n/365;
	n%=365;
	int res = INF;
	for(int i=0;i<=100;i++)
		for(int j=0;j<=100;j++)
			if(i*31+j*7==n)
				res=min(res,i+j);
	int ans=-1;
	if(res!=INF)	ans=tmp+res;
	if(tmp)	n+=365,tmp--;
	
	res=INF;
	for(int i=0;i<=100;i++)
	for(int j=0;j<=150;j++)
		if(i*31+j*7==n)
			res=min(res,i+j);
	if(res!=INF)
	{
		if(ans!=-1)	ans=min(ans,tmp+res);
		else	ans=tmp+res;
	}
	cout<<ans<<endl;
}
signed main()
{
	int T = 1;
	cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}