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
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);

		//入力表示
		String S = sc.next();
		int count=0;
		int ans =0;
	
		char [] a= S.toCharArray();
		 for(int i=0;i<a.length; i++) {

			 if(a[i]=='A' ||a[i]=='C' ||a[i]=='G'||a[i]=='T') {
				 count++;
			 }else {
				 if(ans<count) {
					 ans=count;
					 count=0;
					 
				 }
			 }
			
		 }
		 if(ans<count) {
			 ans=count;
		 }
		 System.out.println(ans);
	}
}