Problem:
Score : 200 points

Problem Statement

Sig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.

To begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:

The 0 key: a letter 0 will be inserted to the right of the string.

The 1 key: a letter 1 will be inserted to the right of the string.

The backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.

Sig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?

Constraints

1 ≦ |s| ≦ 10 (|s| denotes the length of s)

s consists of the letters 0, 1 and B.

The correct answer is not an empty string.

Input

The input is given from Standard Input in the following format:

s

Output

Print the string displayed in the editor in the end.

Sample Input 1

01B0

Sample Output 1

00

Each time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.

Sample Input 2

0BB1

Sample Output 2

1

Each time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

/* ex 8_1
   unomi */

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

//スタックに格納するデータの最大数
#define SIZE 10

//スタックの定義
typedef struct stack{
    int size;
    int count;
    char data[SIZE];
    char *top;
} stack;

//スタックの初期化
void initialize_stack(stack *stk){
    stk->count = 0;
    stk->size = SIZE;
    stk->top = &(stk->data[SIZE]);
}

//データの追加
void push(stack *stk, char elem){
    // スタックがオーバーフローしないなら
    if(stk->count < stk->size){
        stk->top--;  //topを一つ上げる
        *(stk->top) = elem;  // そこに代入
        stk->count++;  // データ数を増やす
    }
}

//データの取り出し
char pop(stack *stk){
    char latest;
    // スタックがアンダーフローしないなら
    if(stk->count > 0){
        latest = *(stk->top);  // topから取り出し
        stk->top++;  // topを一つ下げる
        stk->count--; // データ数を減らす
    }
    return latest;
}

int main(void){
    // スタックの宣言
    stack stk;
    char sentence[10], trush;
    char *ptr;

    // スタックの初期化
    initialize_stack(&stk);

    // 入力の取得
    scanf("%s",sentence);

    // 入力を先頭から確認
    for(int i=0; i<strlen(sentence); i++){
        // 入力が 0 or 1 ならスタックにプッシュ
        if(sentence[i]=='0'||sentence[i]=='1')
            push(&stk, sentence[i]);
        // 入力が B ならスタックからポップ
        else
            trush = pop(&stk);
    }

    // ポインタ変数にtopのアドレスを代入
    ptr = stk.top;
    // topの位置をスタックの底まで戻す
    for(int j=0; j<stk.count-1; j++) ptr++;
    // スタックのデータ数分古い順に表示
    for(int k=0; k<stk.count; k++)
        printf("%c",*ptr--);
    printf("\n");
    return 0;
}