#include <string>
#include <iostream>
using namespace std;
int main() {
	string s;
	cin >> s;
	bool ok = true;
	if (s[0] != 'A') ok = false;
	if (s.substr(2, s.size() - 3).find('C') == string::npos) ok = false;
	int caps = 0;
	for (int i = 1; i < s.size(); ++i) {
		if ('A' <= s[i] && s[i] <= 'Z') ++caps;
	}
	if (caps != 1) ok = false;
	cout << (ok ? "AC" : "WA") << endl;
	return 0;
}
### 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 <string>
#include <iostream>
using namespace std;
int main() {
	string s;
	cin >> s;
	bool ok = true;
	if (s[0] != 'A') ok = false;
	if (s.substr(2, s.size() - 3).find('C') == string::npos) ok = false;
	int caps = 0;
	for (int i = 1; i < s.size(); ++i) {
		if ('A' <= s[i] && s[i] <= 'Z') ++caps;
	}
	if (caps != 1) ok = false;
	cout << (ok ? "AC" : "WA") << endl;
	return 0;
}
```