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 <string>
using namespace std;

int main() {
  string s; cin >> s;
  bool flag = true;

  if(s[0] != 'A') flag = false;
  if(count(s.begin()+2, s.end()-1, 'C') != 1) flag = false;
  int cnt;
  for(int i = 0; i < s.size(); i++) {
    if(s[i] < 'a') cnt++;
  }
  if(cnt != 2) flag = false;

  cout << (flag ? "AC" : "WA") << endl;
}
