#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>,
rb_tree_tag,tree_order_statistics_node_update>;


signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
//    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    int n;

    while (cin >> n) {
        if (n == 0) {
            break;
        }

        map<int, int> a;

        for (int i = 0 ; i < n ; i++) {
            int pos;
            char t;
            int d;

            cin >> pos >> t >> d;

            if (t == 'L') {
                d *= -1;
            }

            a[pos] = pos + d;
        }

        int pos = 0;

        while (a.find(pos) != a.end()) {
            pos = a[pos];
        }

        cout << pos << "\n";
    }
    return 0;
}