100 atcoder#ABC215A. [ABC215A] Your First Judge

[ABC215A] Your First Judge

Score : 100100 points

Problem Statement

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

What is a perfect match?

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

Constraints

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

Input

Input is given from Standard Input in the following format:

SS

Output

Print the answer.

Hello,World!
AC

The string SS perfectly matches Hello,World!.

Hello,world!
WA

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

Hello!World!
WA