#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1 << 19;
vector<int> fa;


int bal_ind(int x){
    return x*2;
}

int jobb_ind(int x){
    return x*2+1;
}

int hozzaad(int akt, int bal, int jobb, int cel, int ertek){
    if(jobb < cel || cel < bal) return -1;
    if(jobb == bal){
        fa[akt] = max(fa[akt], ertek);
        return fa[akt];
    }

    int kozep = (bal + jobb) / 2;
    if(cel <= kozep){
        fa[akt] = max(fa[akt], hozzaad(bal_ind(akt), bal, kozep, cel, ertek));
    }
    else{
        fa[akt] = max(fa[akt], hozzaad(jobb_ind(akt), kozep+1, jobb, cel, ertek));
    }
    return fa[akt];
}

int lekerdez(int akt, int bal, int jobb, int k_bal, int k_jobb){
    if(k_bal > k_jobb) return -1;
    if(jobb < k_bal || k_jobb < bal) return -1;
    if(bal == jobb){
        return fa[akt];
    }
    if(k_bal == bal && k_jobb == jobb){
        return fa[akt];
    }
    int kozep = (bal + jobb) / 2;
    int ki = lekerdez(bal_ind(akt), bal, kozep, k_bal, min(kozep, k_jobb));
    ki = max(ki, lekerdez(jobb_ind(akt), kozep+1, jobb, max(k_bal, kozep+1), k_jobb));
    return ki;
}




int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    fa.assign(2*MAXN, -1);
    string s;
    cin>> s;
    int n = s.size();
    string betuk = "ACGT";
    map<char, vector<int>> db;
    vector<int> ideigl(n);
    int prev;
    for(char c : betuk){
        prev = 0;
        for(int i = 0; i < n; i++){
            if(s[i] == c){
                ideigl[i] = ++prev;
            }
            else{
                ideigl[i] = --prev;
            }
        }
        db.insert({c, ideigl});
    }

    int ki = 1;
    int temp;
    for(char c : betuk){
        vector<int> v = db[c];
        for(int i = n-1; i >= 0; i--){
            temp = lekerdez(1, 0, MAXN, n+v[i]+1, 400000);
            hozzaad(1, 0, MAXN, n+v[i], i);
            ki = max(ki, temp - i + 1);
        }
    }

    cout << ki << "\n";
}