#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long mod_pow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = (res * a) % mod;
    n /= 2;
    a = (a * a) % mod;
  }
  return res;
}
void find(bool ok, vector<int> &a) {
  if (ok)
    for (int i = 0; i < a.size(); ++i) {
      if (a[i] == 0) {
        a[i] = 1;
        return;
      }
    }
  else
    for (int i = a.size() - 1; i >= 0; --i) {
      if (a[i] == 0) {
        a[i] = 1;
        return;
      }
    }
}
void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  vector<int> a(10);
  for (auto i : s) {
    if (i == 'L')
      find(1, a);
    else if (i == 'R')
      find(0, a);
    else
      a[(int)(i - '0')] = 0;
  }
  for (auto i : a) cout << i;
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
}
