Computer Hacking

Miles and Peter from a parallel universe stole a computer with secret data from the Alchemax laboratory. Now Miles is studying its contents. He opened the directory named <<SuperSecretData>> in the terminal. He noticed that files sometimes appear and disappear in this directory on their own. All file names consist of lowercase Latin letters.

At certain moments he wants to know the minimum number of key presses needed to type the name of a file that is in the directory at that moment. Initially the terminal contains an empty string. Miles can press keys for lowercase Latin letters, which appends that letter to the end of the string. He can also press the tab key. It appends letters to the end of the string while the next letter can be determined uniquely. That is, if the terminal contains string $s$ and there is a letter $c$ such that the set of files whose names start with $s\overline{c}$ equals the set of files whose names start with $s$, then $c$ is appended to the end of $s$. The string $s\overline{c}$ here means $s$ followed by $c$.

For example, if the directory contains the files passwords and paroli, and the terminal is empty, pressing tab makes the terminal show pa. Pressing tab again does not change the string. If Miles then presses s, the terminal shows pas. If he presses tab after that, the terminal shows passwords.

Help Miles answer his questions.

The first line contains one integer $q$ ($1 \le q \le 100\,000$), the number of queries. Each of the next $q$ lines is a query that starts with a character giving its type.

If the character is +, a file is added to the directory. Its name $s_i$ follows on the same line ($1 \le |s_i| \le 100\,000$).

If the character is -, a file is removed from the directory. The integer $a_i$ follows on the same line, the number of the file ($1 \le a_i$). Files are numbered from $1$ in the order they appear.

If the character is ?, Miles asks the minimum number of buttons he must press to type the name of a file. The integer $a_i$ follows on the same line, the number of the file he asks about ($1 \le a_i$). Files are numbered from $1$ in the order they appear.

The total length of all $s_i$ does not exceed $10^6$. No two files in the directory have the same name at the same time. Each file is removed at most once. When a query of the third type is made, the file has already been added and has not yet been removed. The file numbers in queries of the second and third types do not exceed the number of files added by that moment.

For each query of the third type, print the answer on a separate line.