#include "iostream"
#include "cstring"
#include "cstdio"
#include "algorithm"
#include "queue"
#include "vector"
#include "queue"
#include "stack"
#include "ctime"
#include "set"
#include "map"
#include "cmath"
using namespace std;
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define mp make_pair
#define rep( i , a , b ) for( int i = (a) , i##end = b ; i <= i##end ; ++ i )
#define per( i , a , b ) for( int i = (a) , i##end = b ; i >= i##end ; -- i )
#define mem( a ) memset( a , 0 , sizeof (a) )
#define all( x ) x.begin() , x.end()
//#define int long long
typedef long long ll;
const int MAXN = 2e5 + 10;
ll n , m;

ll f[MAXN];

void solve() {
	scanf("%lld",&n);
	ll res = n / 365 , re = 0x3f3f3f3f3f3f3f3f;
	n %= 365;
	rep( i , 0 , 30 ) {
		re = min( re , res + f[n] );
		if( res > 0 ) n += 365 , res --;
		else break;
	}
	printf("%lld\n",( re > 1e18 ? -1 : re ));
}

signed main() {
	memset( f , 0x3f , sizeof f );
	f[0] = 0;
	rep( i , 1 , 12000 ) {
		if( i >= 7 ) f[i] = min( f[i] , f[i - 7] + 1 );
		if( i >= 31 ) f[i] = min( f[i] , f[i - 31] + 1 );
	}
//	freopen("in","r",stdin);
//	freopen("out","w",stdout);
	int T;cin >> T;while( T-- ) solve();
//	solve();
}