[ABC215A] Your First Judge

ID: 21256

远端评测题

2000ms

1024MiB

尝试: 0

已通过: 0

难度: (无)

上传者:

admin

Score : $100$ points

Problem Statement

Given a string $S$ , print AC if it perfectly matches Hello,World!; otherwise, print WA.

What is a perfect match?

Strings $A$ is said to perfectly match $B$ when the length of $A$ is equal to that of $B$ , and the $i$ -th character of $A$ is the same as the $i$ -th character of $B$ for every integer $i$ such that $1 \le i \le |A|$ .

Constraints

$1 \le |S| \le 15$
$S$ consists of English lowercase letters, English uppercase letters, ,, and !.

Input

Input is given from Standard Input in the following format:

$S$

Output

Print the answer.

Hello,World!

AC

The string $S$ perfectly matches Hello,World!.

Hello,world!

WA

The seventh character from the beginning should be an uppercase W in Hello,World!, but $S$ has a lowercase w in that position. Thus, $S$ does not match Hello,World!.

Hello!World!

WA

#R215A. [ABC215A] Your First Judge

Problem Statement

Constraints

Input

Output

登录