#include <stdio.h>
#include <algorithm>
int n, arr[14] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192}, temp;
char s[10];
int main()
{
	scanf("%d", &n);
	for(int i = 0; i< n; i++)
	{
		scanf("%s", s);
		if((s[0]-'0')*10 + s[1]- '0' >= 24 || (s[0]-'0')*10 + s[1]- '0'< 0)
		{
			printf("NO\n");
			continue;
		}
		if((s[3]-'0')*10 + s[4]- '0' >= 60 || (s[3]-'0')*10 + s[4]- '0'< 0)
		{
			printf("NO\n");
			continue;
		}
		if(s[0]-'0')
		{
			temp = (s[0]-'0')*1000 + (s[1]-'0')*100 + (s[3]-'0')*10 + (s[4]-'0');
			if(std::lower_bound(arr, arr+14, temp)) {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[3] == '0' && s[4] == '0')
		{
			printf("YES\n");
			continue;
		}
		if((s[0]-'0')*10 + s[1]- '0' == (s[3]-'0')*10 + s[4]- '0')
		{
			printf("YES\n");
			continue;
		}
		if((s[0]-'0')*10 + s[1]- '0' == (s[4]-'0')*10 + s[3]- '0')
		{
			printf("YES\n");
			continue;
		}
		printf("NO\n");
	}
	return 0;
}