Problem: A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: "fced", "xyz", "r" and "dabcef". The following string are not diverse: "az", "aa", "bad" and "babc". Note that the letters 'a' and 'z' are not adjacent.

Formally, consider positions of all letters in the string in the alphabet. These positions should form contiguous segment, i.e. they should come one by one without any gaps. And all letters in the string should be distinct (duplicates are not allowed).

You are given a sequence of strings. For each string, if it is diverse, print "Yes". Otherwise, print "No".

Input

The first line contains integer n (1 ≤ n ≤ 100), denoting the number of strings to process. The following n lines contains strings, one string per line. Each string contains only lowercase Latin letters, its length is between 1 and 100, inclusive.

Output

Print n lines, one line per a string in the input. The line should contain "Yes" if the corresponding string is diverse and "No" if the corresponding string is not diverse. You can print each letter in any case (upper or lower). For example, "YeS", "no" and "yES" are all acceptable.

Example

Input


8
fced
xyz
r
dabcef
az
aa
bad
babc


Output


Yes
Yes
Yes
Yes
No
No
No
No

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
long long i, j;
long long prime_flag[1000000];
void calculate_prime_flag() {
  prime_flag[0] = prime_flag[1] = 1;
  for (i = 2; i < 1000000; i++) {
    if (prime_flag[i] == 0) {
      for (j = i * i; j < 1000000; j += i) {
        prime_flag[j] = 1;
      }
    }
  }
}
using namespace std;
vector<string> v;
int LPS(char *str) {
  int n = strlen(str);
  int i, j, cl;
  int l[n][n];
  for (i = 0; i < n; i++) l[i][i] = 1;
  for (cl = 2; cl <= n; cl++) {
    for (i = 0; i < n - cl + 1; i++) {
      j = i + cl - 1;
      if (str[i] == str[j] && cl == 2)
        l[i][j] = 2;
      else if (str[i] == str[j])
        l[i][j] = l[i + 1][j - 1] + 2;
      else
        l[i][j] = max(l[i][j - 1], l[i + 1][j]);
    }
  }
  return l[0][n - 1];
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
  int result = arr[0];
  for (int i = 1; i < n; i++) result = gcd(arr[i], result);
  return result;
}
vector<int> adj[10];
bool visited[10];
void dfs(int s) {
  visited[s] = true;
  for (int i = 0; i < adj[s].size(); ++i) {
    if (visited[adj[s][i]] == false) dfs(adj[s][i]);
  }
}
void initialize() {
  for (int i = 0; i < 10; ++i) visited[i] = false;
}
int main() {
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  for (int k = 0; k < n; k++) {
    string x;
    vector<char> a;
    set<char> s;
    cin >> x;
    for (int i = 0; i < x.size(); i++) {
      a.push_back(x[i]);
      s.insert(x[i]);
    }
    if (x.size() == 1)
      cout << "YES" << endl;
    else if (x.size() != s.size())
      cout << "NO" << endl;
    else {
      sort(a.begin(), a.end());
      long long t = 0;
      for (int i = 0; i < x.size(); i++) {
        if (i == x.size() - 1) break;
        if (a[i + 1] - a[i] != 1) {
          t = 1;
          break;
        }
      }
      if (t == 0)
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
    a.clear();
    s.clear();
  }
  return 0;
}