#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

string s;
int k, maxi, i, N, maxi1, p;
bool jo;

int kar(char c) {
    if (c == 'A') return 1;
    if (c == 'C') return 2;
    if (c == 'G') return 3;
    return 4;
}

int main()
{
    cin >> s;
    N = s.length();
    vector <vector<int>> x(N + 1, vector <int>(5, 0));

    maxi = 1;

    for (i = 1; i <= N; ++i){
        k = kar(s[i - 1]);

        x[i] = x[i - 1];
        x[i][k]++;
        x[i][0] = max(x[i][0], x[i][k]);
    }

    for (i = 2; i <= N; ++i){
        maxi1 = x[i][0];

        k = max(1, i - 2 * maxi1 + 1);
        jo = false;

        while (!jo){
            p = x[i][0] - x[k - 1][0];
            if (2 * p >= i - k + 1){
                jo = true;
                break;
            }


            k += 2;
        }

        k -= 2;
        maxi = max(maxi, i - k + 1);
    }

    cout << maxi;
    return 0;
}