#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cmath>
#include <cstdio>

using namespace std;
int n, nr1, nr2;
char s[10];
int put[]={1,2,4,8,16,32,64,128,256,512,1024,2048};
int main()
{
    cin>>n;cin.get();
    for(int i = 1; i <= n; ++i)
    {
        cin.getline(s,6);
        nr1=(s[0]-'0')*10 + (s[1]-'0');
        nr2=(s[3]-'0')*10 + (s[4]-'0');
        if(nr1 > 23 || nr2 > 59) {printf("NO\n");continue;}
        if(nr1 == nr2) {printf("YES\n");continue;}
        if(nr2 == 0) {printf("YES\n");continue;}
        if ( s[4]-s[3] == 1 && s[3] - s[1] == 1 && s[1] - s[0] == 1) {printf("YES\n");continue;}
        if (s[0] == '0') {printf("NO\n");continue;}
        else
        {
            nr1=nr1*100+nr2;
            int ok=0;
            for(int j = 0; j < 12; ++j)
                if (nr1 == put[j]) {printf("YES\n");ok=1;break;}
            if (ok==1) continue;
        }

        printf("NO\n");
    }
    return 0;
}