#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 100;
const int maxm = 2e6 + 100;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
char a[maxn];
int vis[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%s", a + 1);
    memset(vis, 0, sizeof(vis));
    int len = strlen(a + 1);
    int ys = 1;
    sort(a + 1, a + 1 + len);
    for (int j = 2; j <= len; j++) {
      if (a[j] != a[j - 1] + 1) ys = 0;
    }
    if (ys)
      printf("Yes\n");
    else
      printf("No\n");
  }
  return 0;
}
