Problem10568--ABC122 —— B - ATCoder

10568: ABC122 —— B - ATCoder

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

SubmitSolved: 1Submit Num: 1StatisticsShowOff!

Description

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$.

Here, a ACGT string is a string that contains no characters other than `A`, `C`, `G` and `T`.

Input

Input is given from Standard Input in the following format:

```
$S$
```

Output

Print the length of the longest ACGT string that is a substring of $S$.

Constraints

-   $S$ is a string of length between $1$ and $10$ (inclusive).
-   Each character in $S$ is an uppercase English letter.

Sample 1 Input 

ATCODER

Sample 1 Output 

3
Among the ACGT strings that are substrings of ATCODER, the longest one is ATC.

Sample 2 Input 

HATAGAYA

Sample 2 Output 

5
Among the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.

Sample 3 Input 

SHINJUKU

Sample 3 Output 

0
Among the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).

Source/Category

 
Submit