#include <fstream>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define pb push_back
#define mp make_pair
#define sortvi(a) sort(a.begin(), a.end())
#define FOR(i, start, final) for (int i=start; i<=final; ++i)
#define ROF(i, start, final) for (int i=start; i>=final; --i)

#define f cin
#define g cout

//void f(int &x){char k;for(k=getchar();k<= 32;k=getchar());for(x=0;'0'<=k;k=getchar())x=x*10+k-'0';}


/*void f(int &x)//parsare cu semn
{
	char k; bool semn=0;
	for (k = getchar(); (k>'9' || k<'0');)
    {
        if (k=='-') semn=1;
        k=getchar();
    }
	for (x = 0; '0' <= k; k = getchar())	x = x * 10 + k - '0';
    if (semn==1) x=-x;
}*/


using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair < int, int> pi;
typedef vector< int > vi;
typedef vector< pair< int, int > > vpi;

char s[10];
int N;

int main()
{
    f.sync_with_stdio(false);
    f>>N;
    while (N--)
    {
        f>>(s+1);

        if (s[1]>'2' || (s[1]=='2' && s[2]>'3') || s[4]>'5')
            { g<<"NO\n"; continue; }

        if (s[5]==s[4] && s[5]=='0'){ g<<"YES\n"; continue; }
        if (s[1]==s[4] && s[2]==s[5]){ g<<"YES\n"; continue; }
        if (s[1]==s[5] && s[2]==s[4]) { g<<"YES\n"; continue; }
        if (s[1]+1==s[2]&& s[2]+1==s[4] && s[4]+1==s[5]) { g<<"YES\n"; continue; }
        int nr=1000*(s[1]-'0')+100*(s[2]-'0')+10*(s[4]-'0')+(s[5]-'0');
        for (; nr%2==0; nr/=2);
        if (nr==1) { g<<"YES\n"; continue; }
        g<<"NO\n";
    }
    return 0;
}