#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long mcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void solve() {
  int n;
  cin >> n;
  string second;
  vector<int> ans(10, 0);
  cin >> second;
  for (int i = 0; i < n; i++) {
    if (second[i] == 'L') {
      for (int j = 0; j < n; j++) {
        if (ans[j] == 0) {
          ans[j] = 1;
          break;
        }
      }
    } else if (second[i] == 'R') {
      for (int j = 9; j >= 0; j--) {
        if (ans[j] == 0) {
          ans[j] = 1;
          break;
        }
      }
    } else {
      ans[(int)second[i] - '0'] = 0;
    }
  }
  for (auto &x : ans) cout << x;
  cout << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t-- > 0) solve();
  return 0;
}
