#include<bits/stdc++.h>

using namespace std;

#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010

typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;

LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}

LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};

///**************************DONE****************************///

int x[] = {111, 222, 333, 444, 555, 666, 777, 888, 999};

int main()
{
    int n;
    cin >> n;

    for(int i = 0; i < 9; i++){
        if(x[i] >= n)
            return cout << x[i] << '\n', 0;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main()
{
  string s;
  cin >> s;
  
  bool flag = true;
  int n = s.size();
  int ok = 0;
  if(s[0] != 'A'){
    cout << "WA" << endl;
    return 0;
  }
  
  for(int i = 2; i <= n-2; i++){
    if(s[i] == 'C'){
      ok++;
    }
  }
  if(ok != 1){
    cout << "WA" << endl;
    return 0;
  }
  
  for(int i = 0; i < n; i++){
    if(s[i] != 'A' && s[i] != 'C' && isupper(s[i])){
      cout << "WA" << endl;
      return 0;
    }
  }
  
  cout << "AC" << endl;
}