Problem Description

You are given a string $ S $ consisting of lowercase English letters (a-z).

Decompose $ S $ into several (not necessarily contiguous) substrings. That is, select multiple substrings from $ S $ such that each character of $ S $ is included in exactly one of these substrings.

Determine if there exists a way to decompose $ S $ such that all resulting substrings are titech.

Input Format

The input is given from the standard input in the following format:

$ S $

• The first line contains the string $S (1 \leq |S| \leq 100)$.

Output Format

Output Yes if decomposition is possible, otherwise output No. Ensure to include a newline at the end of the output.

Sample Input and Output

Sample Input #1

titech

Sample Output #1

Yes

Sample Input #2

tititechtech

Sample Output #2

Yes

Sample Input #3

titecg

Sample Output #3

No

Sample Input #4

tttiiittteeeccchhh

Sample Output #4

Yes

Notes/Hints

Sample Explanation 1

It can be decomposed into one titech.

Sample Explanation 2

For example, it can be decomposed into the 1st, 2nd, 5th, 6th, 7th, 8th characters and the 3rd, 4th, 9th, 10th, 11th, 12th characters, resulting in two titech.

Sample Explanation 4

It can be decomposed into three titech.

见题面 Input 部分

见题面 Output 部分