int centerOf (const vector<int> & A)
{
    vector<int> B(A.size());
    B[0] = A[0];
    for (int i = 1; i < A.size(); i++)
       B[i] = B[i-1] + A[i];
    for (int i = 1; i < n; i++)
    {
        if (B[i - 1] == B[A.size() - 1] - B[i])
        {
            return i;
        }
    }
    return -1;
} 

int reservoir(const vector<int>& A)
{
    int n = A.size();
    vector<int> B(n), C(n);
    B[0] = A[0];
    for (i = 1; i < n; i++)
       B[i] = max(B[i - 1], A[i]);
    C[n - 1] = A[n - 1];
    for (int i = n- 2; i >= 0; i--)
       C[i] = max(C[i + 1], A[i]);

    int ans= 0;
    int c;
    for (int i = 1; i < n - 1; i++)

    {

        c = min(B[i - 1], C[i + 1]);
        if (c > A[i])
            ans += c - A[i];
    }
    return ans;

}

int  evenConsonant(const string& s)
{
    vector<int> a(32, -1);
    int b = 0;
    string A("aeiou");
    int ans = 0;
    for (int i = 0; i < s.size(); i++)
    {
        int p = A.find(s[i]);
        if (p != string::npos)
        {
            b ^= (1 << p);
            if (a[b] == -1)
            {
                a[b] = i;
            }
	}
	ans = max(ans, i - a[b]);
    }
    return ans;
}