module Main where

import           Data.Char (isLower, isUpper)
import Text.ParserCombinators.ReadP (ReadP, char, satisfy, many, eof)
import Control.Monad.State
import Data.List (delete)

parser :: ReadP ()
parser = char 'A' *> lowerChar *> many lowerChar *> char 'C' *> many lowerChar *> lowerChar *> eof
-- parser = char 'A' *> many1 lowerChar *> char 'C' *> many1 lowerChar *> eof

lowerChar :: ReadP Char
lowerChar = satisfy isLower

-- f :: String -> Result
-- f s = if not . null . readP_to_S parser $ s then AC else WA

main :: IO ()
-- main = interact $ show . f
main = print . f =<< getLine

data Result
  = AC
  | WA
  deriving (Show, Eq)

f :: String -> Result
f s = if isHeadA s && containsC s && isRemainLower s then AC else WA

isHeadA :: String -> Bool
isHeadA ('A' : _) = True
isHeadA _         = False

containsC :: String -> Bool
containsC = (1 ==) . length . filter ('C' ==) . init . drop 2

isRemainLower :: String -> Bool
isRemainLower = all isLower . remain

remain :: String -> String
remain s =
  -- filter (`notElem` "AC") s
  delete 'A' $ delete 'C' s

  -- let
  --   middle = filter ('C' /=) . init . drop 2
  -- in
  --   (s !! 1 : middle s) ++ [last s]

tests :: [Bool]
tests =
  [ test1
  , test2
  , test3
  , test4
  , test5
  ]

test1, test2, test3, test4, test5 :: Bool
test1 = f "AtCoder" == AC
test2 = f "ACoder" == WA
test3 = f "AcycliC" == WA
test4 = f "AtCoCo" == WA
test5 = f "Atcoder" == WA

-- f :: String -> Result
-- f s = runState (mapM (g (length s)) $ zip [0..] s) 0

-- g :: Int -> (Int, Char) -> State Int Bool
-- g l (0, c)
--   | c /= 'A' = return False
-- g l (i, c)
--   | isUpper c = do
--     if i == 0 || i == l - 1 || c /= 'C'
--       then return False
--       else modify succ

-- g _ _ = return True
