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 JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.*;

public class DiverseStrings {

	public static void main(String[] args) throws Exception {
		Reader file = new Reader();
		int times = file.nextInt();
		file.nextLine();

		for (int asdf = 0; asdf < times; asdf++) {
			String word = file.nextLine();
			char[] line = word.toCharArray();
			TreeSet<Character> chars = new TreeSet<>();
			ArrayList<Character> chars2 = new ArrayList<Character>();
			boolean works = true;

			for (char val : line) {
				if (!chars.add(val)) {
					works = false;
					break;
				}
				chars2.add(val);
			}

			Collections.sort(chars2);

			if (works) {
				for (int i = 0; i < chars2.size() - 1; i++) {
					if (chars2.get(i) != chars2.get(i + 1) - 1) {
						works = false;
						break;
					}
				}
			}

			if (works) {
				System.out.println("Yes");
			} else {
				System.out.println("No");
			}
		}

	}

	static class Reader {
		private final int BUFFER_SIZE = 1 << 16;
		private char nullChar = (char) 0;
		private byte[] buf = new byte[BUFFER_SIZE];
		private int bufferPointer, bytesRead;
		private char c = nullChar;
		private BufferedInputStream in;
		private char delimeter = ' ';

		public void close() throws IOException {
			in.close();
		}

		public Reader() {
			in = new BufferedInputStream(System.in, BUFFER_SIZE);
			bufferPointer = bytesRead = 0;
		}

		public Reader(InputStream read) {
			in = new BufferedInputStream(read, BUFFER_SIZE);
			bufferPointer = bytesRead = 0;
		}

		public Reader(String s) throws FileNotFoundException {
			try {
				in = new BufferedInputStream(new FileInputStream(new File(s)),
						BUFFER_SIZE);
			} catch (FileNotFoundException e) {
				throw new FileNotFoundException();
			}
			bufferPointer = bytesRead = 0;
		}

		private char nextChar() {
			while (bufferPointer == bytesRead) {
				try {
					bytesRead = in.read(buf);
				} catch (Exception e) {
					return nullChar;
				}
				if (bytesRead == -1) {
					return nullChar;
				}
				bufferPointer = 0;
			}
			try {
				return (char) buf[bufferPointer++];
			} catch (ArrayIndexOutOfBoundsException e) {
				throw new NoSuchElementException("No Line Found");
			}
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while (c < 32 || c == delimeter)
				c = nextChar();
			while (c != nullChar) {
				if (c == '\n' || c == '\r' || c == delimeter) {
					break;
				}
				res.append(c);
				c = nextChar();
			}
			if (c == '\n')
				c = nextChar();
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while (c == delimeter) {
				c = nextChar();
			}
			while (c != nullChar) {
				if (c == '\n' || c == '\r') {
					c = nextChar();
					break;
				}
				res.append(c);
				c = nextChar();
			}
			if (c == '\n')
				c = nextChar();
			return res.toString();
		}

		/**
		 * Note: Setting the delimeter to "-" will remove the methods
		 * ability to read negatives.
		 */
		public int nextInt() {
			return (int) nextLong();
		}

		/**
		 * Note: Setting the delimeter to "-" will remove the methods
		 * ability to read negatives.
		 */
		public long nextLong() {
			while (c == delimeter || c < 32)
				c = nextChar();
			if (c < '0' && c != '-' || c > '9')
				throw new InputMismatchException("" + c);
			boolean neg = (c == '-');
			if (neg)
				c = nextChar();
			long res = 0;
			do {
				res = (res << 3) + (res << 1) + c - '0';
			} while ((c = nextChar()) >= '0' && c <= '9');
			return neg ? -res : res;
		}

		/**
		 * Note: Setting the delimeter to "-" or "." may remove the methods
		 * ability to read negatives or decimals.
		 */
		public double nextDouble() {
			while (c == delimeter || c < 32)
				c = nextChar();
			if (c < '0' && c != '-' && c != '.' || c > '9')
				throw new InputMismatchException("" + c);
			boolean neg = (c == '-');
			if (neg)
				c = nextChar();
			double res = 0.0;
			while (c >= '0' && c <= '9') {
				res = res * 10 + c - '0';
				c = nextChar();
			}
			if (c == '.') {
				double div = 1;
				while ((c = nextChar()) >= '0' && c <= '9') {
					res += (c - '0') / (div *= 10);
				}
			}
			return neg ? -res : res;
		}

		public BigInteger nextBigInteger() {
			while (c == delimeter || c < 32)
				c = nextChar();
			if (!Character.isDigit(c) && c != '-') {
				throw new InputMismatchException();
			}
			StringBuilder strNum = new StringBuilder();
			if (c == '-') {
				strNum.append("-");
				c = nextChar();
			}
			while (Character.isDigit(c)) {
				strNum.append(c);
				c = nextChar();
			}
			return new BigInteger(strNum.toString());
		}

		public BigDecimal nextBigDecimal() {
			while (c == delimeter || c < 32)
				c = nextChar();
			if (!Character.isDigit((c)) && c != '-' && c != '.')
				throw new InputMismatchException();
			StringBuilder strNum = new StringBuilder();
			if (c == '-') {
				strNum.append("-");
				c = nextChar();
			}
			while (Character.isDigit(c) || c == '.') {
				strNum.append(c);
				c = nextChar();
			}
			return new BigDecimal(strNum.toString());
		}

		public char delimeter() {
			return delimeter;
		}

		public void useDelimeter(char c) {
			delimeter = c;
		}

		public boolean hasNext() throws IOException {
			if (c >= 32)
				return true;
			in.mark(BUFFER_SIZE);
			char save = c;
			int savePointer = bufferPointer;
			while (true) {
				c = nextChar();
				if (bytesRead == -1 || c == nullChar)
					return false;
				if (c >= 32) {
					return true;
				}
				if (c == '\n' || c == '\r') {
					for (int i = 0; i < 2; i++) {
						c = nextChar();
						if (c >= 5) {
							in.reset();
							c = save;
							bufferPointer = savePointer;
							return true;
						}
						if (bytesRead == -1 || c == nullChar)
							return false;
					}
				}
			}
		}
	}
}