Problem6656--ABC249 — B - Perfect String

6656: ABC249 — B - Perfect String

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 256 MiB

SubmitSolved: 1Submit Num: 1StatisticsShowOff!

Description

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 alphabet.
  • The string contains a lowercase English alphabet.
  • All characters in the string are pairwise distinct.
For example, AtCoder and Aa are wonderful strings, while atcoder and Perfect are not.
Given a string $S$, determine if $S$ is a wonderful string.

Input

Input is given from Standard Input in the following format:
$S$

Output

If $S$ is a wonderful string, print Yes; otherwise, print No.

Constraints

$1≤∣S∣≤100$
$S$ is a string consisting of uppercase and lowercase English alphabets.

Sample 1 Input 

AtCoder

Sample 1 Output 

Yes
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.

Sample 2 Input 

Aa

Sample 2 Output 

Yes
Note that A and a are different characters. This string is a wonderful string.

Sample 3 Input 

atcoder

Sample 3 Output 

No
It is not a wonderful string because it does not contain an uppercase English alphabet. 

Perfect


No
It is not a wonderful string because the $2$-nd and the $5$-th characters are the same.

Source/Category

AtCoder_ABC 100.249.ABC249 
Submit