#include <iostream>
#include <vector>

using namespace std;

void Solve() {
    string p;
    cin >> p;

    int len = p.size();
    vector<int> vec;
    vec.reserve(len);
    for (int i = len - 1; i >= 0; --i) vec.push_back(p[i] - '0');

    bool single = false;
    for (int i = 0; i < len; ++i) {
        if (i == len - 1) {
            if ((i != 0 && vec[i] == 0) || vec[i] == 6 || vec[i] == 7) {
                puts("Yes");
            } else {
                puts("No");
            }
            return;
        }
        if (single) {
            if (vec[i] != 6 && vec[i] != 7) {
                puts("No");
                return;
            }
        }
        if (vec[i] == 2) { // 6 + 6
            --vec[i + 1];
        } else if (vec[i] == 3) { // 6 + 7
            --vec[i + 1];
        } else if (vec[i] == 4) { // 7 + 7
            --vec[i + 1];
        } else if (vec[i] == 6) {
            single = true;
        } else if (vec[i] == 7) {
            single = true;
        } else {
            puts("No");
            return;
        }
    }
}

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        Solve();
    }

    return 0;
}