#include <bits/stdc++.h>   using namespace std;   const long long int mod = 1000000000 + 7;   long long int n, k, summ, tr, a[1000000], minn, maxx;   string s, s1;   map<int, int> been;   int compare(const void* a, const void* b) {     return ((*(long long int*)a) - (*(long long int*)b));   };   int gcd(int a, int b) {     while (b != 0) {       int t = b;       b = a % b;       a = t;     }     return a;   }   int NOK(int n1, int n2) { return n1 * n2 / gcd(n1, n2); }   int main() {     cin >> n;     for (int i = 0; i < n; i++) {       been.clear();       maxx =  a  - 1;       minn =  z  + 1;       cin >> s;       for (int j = 0; j < s.length(); j++) {         if (been[s[j]] == 1) {           minn = -1000;           break;         }         been[s[j]] = 1;         minn = min(minn, (long long int)s[j]);         maxx = max(maxx, (long long int)s[j]);       }       if (maxx - minn + 1 != s.length()) {         cout <<  No  << endl;       } else {         cout <<  Yes  << endl;       }     }     return 0;   }   