// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

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

    vi pref(n+1), suff(n+1);
    vi pref_tot(n+1), suff_tot(n+1);

    FOR(n) {
        pref[i+1] = pref[i] + (s[i] == 'A' || s[i] == '?');
        if(s[i] == 'C') pref_tot[i+1] = pref_tot[i] + pref[i];
        else pref_tot[i+1] = pref_tot[i];
    }
    for(int i = n-1; i >= 0; i--) {
        suff[i] = suff[i+1] + (s[i] == 'C' || s[i] == '?');
        if(s[i] == 'A') suff_tot[i] = suff_tot[i+1] + suff[i+1];
        else suff_tot[i] = suff_tot[i+1];
    }

    int ans = 0;
    int qtot = (int)count(all(s), '?');
    int q = 0;
    int a = 0, c = (int)count(all(s), 'C');
    FOR(n+1) {
        chmax(ans, pref_tot[i] + suff_tot[i] + (a + q) * (c + qtot - q));
        if(i == n) continue;
        if(s[i] == 'A') a++;
        if(s[i] == 'C') c--;
        if(s[i] == '?') q++;
    }

    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}