#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int n;
string s;
int flag1 = 1;
int flag2 = 1;
int a[1000];
int count1 = 0;
map<char, int> mp;
int main() {
  cin >> n;
  while (n--) {
    flag1 = 1;
    flag2 = 1;
    cin >> s;
    sort(s.begin(), s.end());
    for (int i = 0; i < s.size(); i++) {
      mp[s[i]]++;
    }
    for (int i = 'A' - '0'; i <= 'Z' - '0'; i++) {
      if (mp[i] > 1) {
        flag1 = 0;
        mp[i] = 0;
      }
    }
    for (int i = 1; i < s.size(); i++) {
      if ((s[i] - '0') != (s[i - 1] - '0') + 1) {
        flag2 = 0;
      }
    }
    if (flag1 == 0 || flag2 == 0) {
      cout << "No" << endl;
    } else
      cout << "Yes" << endl;
  }
  return 0;
}
