#include <bits/stdc++.h>
using namespace std;
string ch;
int mn, mx, m, n, dp[500];
void emptyit() {
  for (int k = 65; k < 123; k++) dp[k] = 0;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> ch;
    emptyit();
    int m = ch.size();
    int mn = 200;
    for (int j = 0; j < m; j++) {
      int x = ch[j];
      mn = min(mn, x);
      dp[x]++;
    }
    mx = mn + ch.size();
    while ((dp[mn] == 1) && (mn < mx)) mn++;
    if (mn == mx)
      cout << "Yes";
    else
      cout << "No";
    cout << '\n';
  }
}
