101921: [AtCoder]ABC192 B - uNrEaDaBlE sTrInG

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $200$ points

Problem Statement

We call a string hard-to-read when its odd-positioned ($1$-st, $3$-rd, $5$-th, ... from the beginning) characters are all lowercase English letters and its even-positioned characters ($2$-nd, $4$-th, $6$-th, ... from the beginning) are all uppercase English letters.

Determine whether a string $S$ is hard-to-read.

Constraints

  • $S$ consists of uppercase and lowercase English letters.
  • The length of $S$ is between $1$ and $1000$ (inclusive).

Input

Input is given from Standard Input in the following format:

$S$

Output

If $S$ is hard-to-read, print Yes; otherwise, print No.


Sample Input 1

dIfFiCuLt

Sample Output 1

Yes

The odd-positioned characters are all lowercase and the even-positioned characters are all uppercase, so it is hard-to-read.


Sample Input 2

eASY

Sample Output 2

No

The $3$-rd character is not lowercase, so it is not hard-to-read.


Sample Input 3

a

Sample Output 3

Yes

Input

题意翻译

定义一个字符串是难以阅读的,当且仅当所有偶数位上是大写字母,奇数位上是小写字母。 给定一个字符串,判断是否是难以阅读的。如果是,则输出 `Yes`,否则输出 `No`。 下标从 $1$ 开始。

加入题单

算法标签: