#include <iostream>
#include <algorithm>
#include <set>

using namespace std;

const int MAXN = 100001;
int N, A[MAXN], C[MAXN], pref[MAXN];
set<int> pr, sl;

int main() {
    ios::sync_with_stdio(false);
    cin >> N;
    for (int i = 0; i < 2 * N - 1; ++i) {
        if (i % 2 == 0)
            cin >> A[i / 2];
        else {
            char c;
            cin >> c;
            if (c == 'J') {
                C[(i + 1) / 2] = 1;
                pref[(i + 1) / 2] = pref[i / 2] + 1;
            }
            else {
                C[(i + 1) / 2] = -1;
                pref[(i + 1) / 2] = pref[i / 2] - 1;
            }
        }
    }
    int mn = 0, fst = 0, lst = 0;
    for (int i = 0; i < N; ++i) {
        if (pref[i] < mn) {
            mn = pref[i];
            fst = lst = i;
        }
        else if (pref[i] == mn)
            lst = i;
    }
    
    int ans = max(A[fst], A[lst]);
    int pos = (ans == A[fst] ? fst : lst);
    cout << ans << endl;

    for (int i = 1; i < N; ++i) {
        if (i < pos && C[i] > 0)
            pr.insert(i);
        if (i > pos && C[i] < 0)
            sl.insert(i);
    }
    if (fst != lst) {
        if (pos == fst) {
            cout << 2 * (*(sl.begin())) << endl;
        }
        else {
            cout << 2 * (*pr.rbegin()) << endl;
        }
    }
    else {
        if (!sl.empty())
            cout << 2 * (*sl.begin()) << endl;
        else if (!pr.empty())
            cout << 2 * (*pr.rbegin()) << endl;
        else
            cout << 2 << endl;
    }

    return 0;
}