#include <bits/stdc++.h>
using namespace std;

int main(){
    string s;cin>>s;vector<int> list(58);int n=0;
    for(int i=0;i<s.size();i++){
        list.at(s.at(i)-'A')++;
    }
    for(int i=32;i<58;i++) n+=list.at(i);
    if(s.at(0)=='A'&&list.at(2)==1&&n==s.size()-2&&s.at(1)!='C'&&s.at(s.size()-1)!='C') cout<<"AC"<<endl;
    else cout<<"WA"<<endl;
}
### Prompt

Please provide a CPP coded solution to the problem described below:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

int main(){
    string s;cin>>s;vector<int> list(58);int n=0;
    for(int i=0;i<s.size();i++){
        list.at(s.at(i)-'A')++;
    }
    for(int i=32;i<58;i++) n+=list.at(i);
    if(s.at(0)=='A'&&list.at(2)==1&&n==s.size()-2&&s.at(1)!='C'&&s.at(s.size()-1)!='C') cout<<"AC"<<endl;
    else cout<<"WA"<<endl;
}
```