{"raw_statement":[{"iden":"problem statement","content":"Let us call a string consisting of uppercase and lowercase English alphabets a **wonderful string** if all of the following conditions are satisfied:\n\n*   The string contains an uppercase English alphabet.\n*   The string contains a lowercase English alphabet.\n*   All characters in the string are pairwise distinct.\n\nFor example, `AtCoder` and `Aa` are wonderful strings, while `atcoder` and `Perfect` are not.\nGiven a string $S$, determine if $S$ is a wonderful string."},{"iden":"constraints","content":"*   $1 \\le |S| \\le 100$\n*   $S$ is a string consisting of uppercase and lowercase English alphabets."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"AtCoder"},{"iden":"sample output 1","content":"Yes\n\n`AtCoder` is a wonderful string because it contains an uppercase English alphabet, a lowercase English alphabet, and all characters in the string are pairwise distinct."},{"iden":"sample input 2","content":"Aa"},{"iden":"sample output 2","content":"Yes\n\nNote that `A` and `a` are different characters. This string is a wonderful string."},{"iden":"sample input 3","content":"atcoder"},{"iden":"sample output 3","content":"No\n\nIt is not a wonderful string because it does not contain an uppercase English alphabet."},{"iden":"sample input 4","content":"Perfect"},{"iden":"sample output 4","content":"No\n\nIt is not a wonderful string because the $2$\\-nd and the $5$\\-th characters are the same."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}