Today Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her t queries, each of one of the following type:   +  a_{i} — add non-negative integer a_{i} to the multiset. Note, that she has a multiset, thus there may be many occurrences of the same integer.   -  a_{i} — delete a single occurrence of non-negative integer a_{i} from the multiset. It's guaranteed, that there is at least one a_{i} in the multiset.  ? s — count the number of integers in the multiset (with repetitions) that match some pattern s consisting of 0 and 1. In the pattern, 0 stands for the even digits, while 1 stands for the odd. Integer x matches the pattern s, if the parity of the i-th from the right digit in decimal notation matches the i-th from the right digit of the pattern. If the pattern is shorter than this integer, it's supplemented with 0-s from the left. Similarly, if the integer is shorter than the pattern its decimal notation is supplemented with the 0-s from the left. 

For example, if the pattern is s = 010, than integers 92, 2212, 50 and 414 match the pattern, while integers 3, 110, 25 and 1030 do not.


-----Input-----

The first line of the input contains an integer t (1 ≤ t ≤ 100 000) — the number of operation Sonya has to perform.

Next t lines provide the descriptions of the queries in order they appear in the input file. The i-th row starts with a character c_{i} — the type of the corresponding operation. If c_{i} is equal to '+' or '-' then it's followed by a space and an integer a_{i} (0 ≤ a_{i} < 10^18) given without leading zeroes (unless it's 0). If c_{i} equals '?' then it's followed by a space and a sequence of zeroes and onse, giving the pattern of length no more than 18.

It's guaranteed that there will be at least one query of type '?'.

It's guaranteed that any time some integer is removed from the multiset, there will be at least one occurrence of this integer in it.


-----Output-----

For each query of the third type print the number of integers matching the given pattern. Each integer is counted as many times, as it appears in the multiset at this moment of time.


-----Examples-----
Input
12
+ 1
+ 241
? 1
+ 361
- 241
? 0101
+ 101
? 101
- 101
? 101
+ 4000
? 0

Output
2
1
2
1
1

Input
4
+ 200
+ 200
- 200
? 0

Output
1



-----Note-----

Consider the integers matching the patterns from the queries of the third type. Queries are numbered in the order they appear in the input.   1 and 241.  361.  101 and 361.  361.  4000.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'LVL = 18\nfrom collections import defaultdict\n\n\ndef pattern_repr(x):\n    rep = [1 if int(x) % 2 else 0 for x in x]\n    return [0] * (LVL - len(rep)) + rep\n\n\nclass Node:\n    def __init__(self, key, node_id=0):\n        self.key = key\n        self.node_id = node_id\n        self.left = None\n        self.right = None\n\n\nclass CodeforcesTask713ASolution:\n    def __init__(self):\n        self.result = \'\'\n        self.t = 0\n        self.queries = []\n\n    def read_input(self):\n        self.t = int(input())\n        for _ in range(self.t):\n            self.queries.append(input().split(" "))\n\n    def process_task(self):\n        res = []\n        root = Node(0, 1)\n        node_id = 2\n        treesol = False\n        if treesol:\n            for query in self.queries:\n                if query[0] in "+-":\n                    pattern = pattern_repr(query[1])\n                    #print(pattern)\n                    current = root\n                    while pattern:\n                        #print(current.node_id)\n                        if pattern[0]:\n                            # going right\n                            if current.right:\n                                current = current.right\n                            else:\n                                current.right = Node(0, node_id)\n                                current = current.right\n                                node_id += 1\n                        else:\n                            # going left\n                            if current.left:\n                                current = current.left\n                            else:\n                                current.left = Node(0, node_id)\n                                current = current.left\n                                node_id += 1\n                        pattern = pattern[1:]\n                    current.key += 1 if query[0] == "+" else -1\n                    #print(current.key, current.node_id)\n                else:\n                    pattern = [int(x) for x in "0" * (LVL - len(query[1])) + query[1]]\n                    current = root\n                    #print(pattern)\n                    while pattern:\n                        if pattern[0]:\n                            # going right\n                            if current.right:\n                                current = current.right\n                            else:\n                                current = Node(0)\n                                pattern = []\n                        else:\n                            # going left\n                            if current.left:\n                                current = current.left\n                            else:\n                                current = Node(0)\n                                pattern = []\n                        pattern = pattern[1:]\n                    res.append(current.key)\n        else:\n            counts = defaultdict(int)\n            for query in self.queries:\n\n                if query[0] in "+-":\n                    pattern = "0" * (LVL - len(query[1])) + "".join(("1" if int(x) % 2 else "0" for x in query[1]))\n                    counts[pattern] += 1 if query[0] == "+" else -1\n                else:\n                    pattern = "0" * (LVL - len(query[1])) + query[1]\n                    res.append(counts[pattern])\n\n        self.result = "\\n".join([str(x) for x in res])\n\n    def get_result(self):\n        return self.result\n\n\ndef __starting_point():\n    Solution = CodeforcesTask713ASolution()\n    Solution.read_input()\n    Solution.process_task()\n    print(Solution.get_result())\n\n__starting_point()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 20635