#include <bits/stdc++.h>
void sort(char a[], int l, int r) {
  int i = l, j = r;
  char t = a[i];
  if (l > r) return;
  while (i < j) {
    while (i < j && a[j] >= t) j--;
    a[i] = a[j];
    while (i < j && a[i] <= t) i++;
    a[j] = a[i];
  }
  a[i] = t;
  sort(a, l, i - 1);
  sort(a, i + 1, r);
}
int main() {
  int n, i, flag;
  char a[105];
  scanf("%d", &n);
  while (n--) {
    flag = 0;
    scanf(" %s", a);
    sort(a, 0, strlen(a) - 1);
    for (i = 0; i < strlen(a) - 1; i++) {
      if (a[i + 1] - a[i] != 1) {
        flag = 1;
        break;
      }
    }
    if (flag == 1)
      printf("No\n");
    else
      printf("Yes\n");
  }
}
