#include <bits/stdc++.h>
using namespace std;
static const int maxn = 100010;
static const int INF = 0x3f3f3f3f;
static const int mod = (int)1e9 + 7;
static const double eps = 1e-6;
static const double pi = acos(-1);
void redirect() {}
char s[maxn];
int cnt[26];
int main() {
  redirect();
  int T;
  scanf("%d", &T);
  while (T--) {
    memset(cnt, 0, sizeof(cnt));
    scanf("%s", s);
    for (int i = 0; s[i]; i++) cnt[s[i] - 'a']++;
    bool flag = true;
    for (int i = 0; i < 26; i++)
      if (cnt[i] > 1) flag = false;
    int i = 0;
    while (i < 26 && cnt[i] == 0) i++;
    while (i < 26 && cnt[i] == 1) i++;
    for (; i < 26; i++)
      if (cnt[i]) flag = false;
    if (flag)
      puts("Yes");
    else
      puts("No");
  }
  return 0;
}
