#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 int64_t ll;

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

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

	vector<vector<ll>> v(4);
	for(ll i = 0; i < n; i++) {
		if(s[i] == 'A') {
			v[0].push_back(i);
		}else if(s[i] == 'C') {
			v[1].push_back(i);
		}else if(s[i] == 'G') {
			v[2].push_back(i);
		}else if(s[i] == 'T') {
			v[3].push_back(i);
		}
	}

	ll ans = 0;

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

		ll m = v[i].size();
		ll r = 0;
		for(ll j = 0; j < m; j++) {

			// length of sequence: v[r] - v[j] + 1
			// amount of char in the sequence: r - j + 1

			// lenhalf = len / 2 + len % 2

			if(r < j) {
				r = j;
			}

			ll seglen = v[i][r] - v[i][j] + 1;
			ll segam = r - j + 1;
			ll seghalf = seglen / 2 + seghalf % 2;

			while(r < m - 1) {

				ll nextseglen = v[i][r+1] - v[i][j] + 1;
				ll nextsegam = r+1 - j+1;
				ll nextseghalf = nextseglen / 2 + nextseglen % 2;

				if(nextsegam >= nextseghalf) {
					
					seglen = nextseglen;
					segam = nextsegam;
					seghalf = nextseghalf;

					r++;
				}else{
					break;
				}
			}

			ll bif = v[i][j];
			ll aft = n - 1 - v[i][r];

			ll maxlen = segam * 2;
			
			ll need = maxlen - seglen;

			ll anshere = seglen + min(need, bif + aft);

			ans = max(ans, anshere);

		}

	}

	cout << ans;

}

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

	solve();

	return 0;
}