#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1, oo = 1e9, MOD = 1073741824;
int t, n, k, a[N], ans;
int main() {
  cin >> t;
  while (t--) {
    string s;
    int freq[26] = {0};
    bool b = 0;
    cin >> s;
    sort(s.begin(), s.end());
    for (int i = 0; i < s.size(); i++) {
      if (freq[s[i] - 'a']++ > 0) {
        puts("NO");
        b = 1;
        break;
      }
      if (s[i] - s[i - 1] > 1 && i) {
        puts("NO");
        b = 1;
        break;
      }
    }
    if (!b) puts("YES");
  }
  return 0;
}
