Simulated Backspace String Processing

You are given a string s consisting of lowercase letters and the character #. The # character represents a backspace operation. When a backspace is encountered, it deletes the character immediately before it (if any). Your task is to process the string accordingly and output the final string after all backspaces have been applied.

For example, if s = "abc#d", the final string will be "abd" because the # removes the 'c'. In another example, if s = "a#b#c#", every character is deleted, resulting in an empty string.

The backspace operation can be formally described by the following procedure:

Let \(R\) be an initially empty result string. For each character \(c\) in the input string s:

• If \(c = \#\) and \(R\) is not empty, remove the last character of \(R\).
• If \(c \neq \#\), append \(c\) to \(R\).

Output the resulting string \(R\).

inputFormat

The input consists of a single line containing the string s (with length at least 0 and up to a reasonable limit) that contains lowercase letters and the character #.

You should read the input from the standard input (stdin).

outputFormat

Output a single line representing the final string after processing all backspace operations. Write the output to standard output (stdout).

## sample

abcdef

abcdef