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.

Constraints

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

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.

Examples

Input

ATCODER

Output

3

Input

HATAGAYA

Output

5

Input

SHINJUKU

Output

0

见题面

见题面