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;
    int c=0,a=0;
   for(int i=2;i<s.size()-1;i++){
    if(s[i]=='C'){c++;}
   }
   for(int i=1;i<s.size();i++){
    if(s[i]=='C'){c++;}
    else if(islower(s[i])){a++;}
   }
   if(c==2&&s[0]=='A'&&a==s.size()-2){cout<<"AC";}
   else{cout<<"WA";}
    return 0;
}
