{"problem":{"name":"Perfect String","description":{"content":"Let us call a string consisting of uppercase and lowercase English alphabets a **wonderful string** if all of the following conditions are satisfied: *   The string contains an uppercase English alph","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc249_b"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\le |S| \\le 100$\n*   $S$ is a string consisting of uppercase and lowercase English alphabets.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc249_b","tags":[],"sample_group":[["AtCoder","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."],["Aa","Yes\n\nNote that `A` and `a` are different characters. This string is a wonderful string."],["atcoder","No\n\nIt is not a wonderful string because it does not contain an uppercase English alphabet."],["Perfect","No\n\nIt is not a wonderful string because the $2$\\-nd and the $5$\\-th characters are the same."]],"created_at":"2026-03-03 11:01:13"}}