{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ consisting of uppercase English letters. Find the length of the longest _ACGT string_ that is a substring (see Notes) of $S$.\nHere, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`."},{"iden":"notes","content":"A substring of a string $T$ is a string obtained by removing zero or more characters from the beginning and the end of $T$.\nFor example, the substrings of `ATCODER` include `TCO`, `AT`, `CODER`, `ATCODER` and (the empty string), but not `AC`."},{"iden":"constraints","content":"*   $S$ is a string of length between $1$ and $10$ (inclusive).\n*   Each character in $S$ is an uppercase English letter."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"ATCODER"},{"iden":"sample output 1","content":"3\n\nAmong the ACGT strings that are substrings of `ATCODER`, the longest one is `ATC`."},{"iden":"sample input 2","content":"HATAGAYA"},{"iden":"sample output 2","content":"5\n\nAmong the ACGT strings that are substrings of `HATAGAYA`, the longest one is `ATAGA`."},{"iden":"sample input 3","content":"SHINJUKU"},{"iden":"sample output 3","content":"0\n\nAmong the ACGT strings that are substrings of `SHINJUKU`, the longest one is (the empty string)."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}