// UUID: 18a78e50-b77d-4b89-884e-d0a9f99a3b42
#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int32_t ll;

void solve() {
	
	string s;
	cin >> s;

	// mind a negy karakterre (A, C, G, T) csinalunk egy twopointerst
	
	ll n = s.length();

	// miutan az elozo otlet sehogy sem valt be, elolvastam a hinteket

	vector<ll> v(n, 0);

	for(ll i = 0; i < n; i++) {

		if(s[i] == 'A') {
			v[i] = 1;
		}else if(s[i] == 'C') {
			v[i] = 2;
		}else if(s[i] == 'G') {
			v[i] = 3;
		}else if(s[i] == 'T') {
			v[i] = 4;
		}
	}	

	ll ans = 0;

	for(ll i = 1; i <= 4; i++) {

		vector<ll> pref(n, 0);
		
		map<ll,ll> mp;

		ll ansh = 0;

		for(ll j = 0; j < n; j++) {

			if(v[j] == i) {
				pref[j]++;
			}else{
				pref[j]--;
			}

			if(j > 0) {
				pref[j] += pref[j-1];
			}
			
			if(pref[j] >= 0) {
				ansh = j+1;
			}

			if(mp.count(pref[j]) == 0) {
				mp[pref[j]] = j;
			}else{
				ansh = max(ansh, j - mp[pref[j]]);
			}
 		}

		ans = max(ansh, ans);
	}

	cout << ans;
}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}