题解 | 魔法棒

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define endl '\n'
int mod = 1000000007;
const int N = 2e5 + 5;



void solve()
{
	int x; cin >> x;
	if (x == 2 || x == 3 || x == 5 || x == 6 || x == 8 || x == 11 || x == 14)
		cout << "No" << endl;
	else
		cout << "Yes" << endl;
}

signed main()
{
	ios::sync_with_stdio, cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--)
	{
		solve();
	}

	return 0;
}