n = int(input())
s = input()
ans = [0] * 10
for i in s:
if i == 'L':
for j in range(10):
if not ans[j]:
ans[j] = 1
break
elif i == 'R':
for l in range(10):
if not ans[9 - l]:
ans[9 - l] = 1
break
else:
ans[int(i)] = 0
print(*ans, sep = '')
#include<stdio.h>
#include<unordered_map>
#include<iostream>
#include<string>
#include<stack>
#include<set>
#include<string.h>
#include<algorithm>
#include<deque>
#include<vector>
using namespace std;
typedef unsigned int uint;
//char s[1000000];
int ans[10];
int main() {
int n;
cin >> n;
//scanf("%s", s);
for (int i = 0; i < n; i++) {
char th;
cin >> th;
if (th == 'L') {
int j = 0;
while (ans[j]) j++;
ans[j] = 1;
}
if (th == 'R') {
int j = 9;
while (ans[j]) j--;
ans[j] = 1;
}
else {
ans[th - '0'] = 0;
}
}
for (int j = 0; j < 10; j++) {
cout << ans[j];
}
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |