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


import java.util.Scanner;
import java.util.regex.Pattern;

public class Main {

    static Scanner sc = new Scanner(System.in);


    public static void main(String[] args) {
        String s = sc.next();
        boolean result = false;

        int indexC = s.indexOf("C");

        if ("A".equals(s.substring(0, 1)) && indexC >= 2 && indexC <= s.length() - 2 && !onemoretime(s, 'C')) {
            s = s.replace("A", "");
            s = s.replace("C", "");
            String pattern = "^[a-z]+$";
            Pattern p = Pattern.compile(pattern);
            if (p.matcher(s).find()) {
                result = true;
            }
        }
        System.out.println(result ? "AC" : "WA");

    }

    static boolean onemoretime(String str, char target) {
        return str.length() - str.replace(target + "", "").length() > 1;
    }
}
