#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; bool containsDragonBall(const string &s, const string &target) { size_t pos = 0; bool found = false; while (true) { pos = s.find(target, pos); if (pos == string::npos) { break; } found = true; pos += target.length(); // Move past this occurrence to find next } return found; } int main() { int n; cin >> n; cin.ignore(); // Ignore the newline after reading n vector<string> targets = {"one", "two", "three", "four", "five", "six", "seven"}; for (int i = 0; i < n; ++i) { string s; getline(cin, s); bool allFound = true; for (const string &target : targets) { if (!containsDragonBall(s, target)) { allFound = false; break; } } if (allFound) { cout << "Yes" << endl; } else { cout << "No" << endl; } } return 0; }