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)

//ex9_1
//TKC001

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define SIZE 10

//data[SIZE-1]がstackの底、data[0]が天井、topはstackの一番上の要素の位置
typedef struct stack{
    int size;
    int count;
    char data[SIZE];
    char *top;
} stack;
//stackの初期化、何もないっていない状態にする。
void init_stack(stack *stk){
    stk->count = 0;
    stk->size = SIZE;
    stk->top = &(stk->data[SIZE]);
}
//番号が若い方が上なので、stackに要素が追加されるとtopが小さくなる
void push(stack *stk, char elem){
    if(stk->count >= stk->size){
        fprintf(stderr, "Error: stack overflow. (x=%c)\n", elem);
        exit(1);
    }
    else{
        stk->top--;
        *(stk->top) = elem;
        stk->count++;
    }
}

//配列dataの一番番号の若いやつをstackから外す。
void delete(stack *stk){
    if(stk->count <= 0){
        //何もしないけど気持ち悪いから書いた
    }
    else{
        stk->top++;
        stk->count--;
    }
}
//dataの中身を後ろからcount個出力=stackの内容をすべて出力
void print_stack(stack *stk){
    int i;
    for(i = SIZE-1; i > SIZE-1-stk->count; i--){
        printf("%c", stk->data[i]);
    }
}

int main(void){
    int i;
    char str[SIZE+1];
    stack stk;
    //stackの初期化
    init_stack(&stk);
    //入力
    scanf("%s", str);
    //strの要素に応じてpushとdeleteを決める
    for (i = 0; i < strlen(str); i++){
        if(str[i] == 'B'){
            delete(&stk);
        }
        else if(str[i] == '0'){
            push(&stk, '0');
        }else{
            push(&stk, '1');
        }
    }
    //出力
    print_stack(&stk);
    

    return 0;
}