#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cstdlib>
#include <climits>
#include <map>

#define ll long long
#define ull unsigned long long

using namespace std;

int main() {
    
    int n;
    string S[55];
    map <int, bool> M;
    
    M[1] = M[2] = M[4] = M[8] = M[16] = M[32] = M[64] = M[128] = M[256] = M[512] = M[1024] = M[2048] = true;
    
    cin >> n;
    
    for (int i = 1; i <= n; i++)
        cin >> S[i];
    
    for (int i = 1; i <= n; i++) {
        
        string s = S[i];
        
        int x, y, cnt1, cnt2;
        int aux = 0, num = 0, cnt = 0;
        
        for (int j = 0; j < s.size(); j++) {
            if (s[j] != ':')
                aux = aux * 10 + int(s[j]-48),
                num = num * 10 + int(s[j]-48),
                cnt++;
            else
                x = aux, aux = 0, cnt1 = cnt, cnt = 0;
        }
        
        y = aux;
        cnt2 = cnt;
        
        if (cnt1 != 2 || cnt2 != 2) {
            cout << "NO\n";
            continue;
        }
        
        if ((x >= 0 && x < 24 && y >= 0 && y < 60)){
            
            if (y == 0 || x == y || (s[0] == s[4] && s[1] == s[3]) || M[num] == true){
                cout << "YES\n";
                continue;
            }
            
            if (s[0] < s[1] && s[1] < s[3] && s[3] < s[4]) {
                cout << "YES\n";
                continue;
            }
            
        }
        
        cout << "NO\n";
        
    }
    
    return 0;
}