You are given a string S. Each character of S is uppercase or lowercase English letter. Determine if S satisfies all of the following conditions:

* The initial character of S is an uppercase `A`.
* There is exactly one occurrence of `C` between the third character from the beginning and the second to last character (inclusive).
* All letters except the `A` and `C` mentioned above are lowercase.

Constraints

* 4 ≤ |S| ≤ 10 (|S| is the length of the string S.)
* Each character of S is uppercase or lowercase English letter.

Input

Input is given from Standard Input in the following format:


S


Output

If S satisfies all of the conditions in the problem statement, print `AC`; otherwise, print `WA`.

Examples

Input

AtCoder


Output

AC


Input

ACoder


Output

WA


Input

AcycliC


Output

WA


Input

AtCoCo


Output

WA


Input

Atcoder


Output

WA
#include <iostream>
#include <algorithm>
#include <cctype>

int main() {
    std::string S;
    std::cin >> S;

    bool cond1 = S[0] == 'A';
    bool cond2 = std::count(S.begin() + 2, S.end() - 1, 'C') == 1;
    bool cond3 = std::count_if(S.begin(), S.end(), isupper) == 2;
    std::cout << (cond1 && cond2 && cond3 ? "AC" : "WA") << std::endl;
}
