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.
LVL = 18
from collections import defaultdict


def pattern_repr(x):
    rep = [1 if int(x) % 2 else 0 for x in x]
    return [0] * (LVL - len(rep)) + rep


class Node:
    def __init__(self, key, node_id=0):
        self.key = key
        self.node_id = node_id
        self.left = None
        self.right = None


class CodeforcesTask713ASolution:
    def __init__(self):
        self.result = ''
        self.t = 0
        self.queries = []

    def read_input(self):
        self.t = int(input())
        for _ in range(self.t):
            self.queries.append(input().split(" "))

    def process_task(self):
        res = []
        root = Node(0, 1)
        node_id = 2
        treesol = False
        if treesol:
            for query in self.queries:
                if query[0] in "+-":
                    pattern = pattern_repr(query[1])
                    #print(pattern)
                    current = root
                    while pattern:
                        #print(current.node_id)
                        if pattern[0]:
                            # going right
                            if current.right:
                                current = current.right
                            else:
                                current.right = Node(0, node_id)
                                current = current.right
                                node_id += 1
                        else:
                            # going left
                            if current.left:
                                current = current.left
                            else:
                                current.left = Node(0, node_id)
                                current = current.left
                                node_id += 1
                        pattern = pattern[1:]
                    current.key += 1 if query[0] == "+" else -1
                    #print(current.key, current.node_id)
                else:
                    pattern = [int(x) for x in "0" * (LVL - len(query[1])) + query[1]]
                    current = root
                    #print(pattern)
                    while pattern:
                        if pattern[0]:
                            # going right
                            if current.right:
                                current = current.right
                            else:
                                current = Node(0)
                                pattern = []
                        else:
                            # going left
                            if current.left:
                                current = current.left
                            else:
                                current = Node(0)
                                pattern = []
                        pattern = pattern[1:]
                    res.append(current.key)
        else:
            counts = defaultdict(int)
            for query in self.queries:

                if query[0] in "+-":
                    pattern = "0" * (LVL - len(query[1])) + "".join(("1" if int(x) % 2 else "0" for x in query[1]))
                    counts[pattern] += 1 if query[0] == "+" else -1
                else:
                    pattern = "0" * (LVL - len(query[1])) + query[1]
                    res.append(counts[pattern])

        self.result = "\n".join([str(x) for x in res])

    def get_result(self):
        return self.result


def __starting_point():
    Solution = CodeforcesTask713ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())

__starting_point()
LVL = 18
from collections import defaultdict


def pattern_repr(x):
    rep = [1 if int(x) % 2 else 0 for x in x]
    return [0] * (LVL - len(rep)) + rep


class Node:
    def __init__(self, key, node_id=0):
        self.key = key
        self.node_id = node_id
        self.left = None
        self.right = None


class CodeforcesTask713ASolution:
    def __init__(self):
        self.result = ''
        self.t = 0
        self.queries = []

    def read_input(self):
        self.t = int(input())
        for _ in range(self.t):
            self.queries.append(input().split(" "))

    def process_task(self):
        res = []
        root = Node(0, 1)
        node_id = 2
        treesol = False
        if treesol:
            for query in self.queries:
                if query[0] in "+-":
                    pattern = pattern_repr(query[1])
                    #print(pattern)
                    current = root
                    while pattern:
                        #print(current.node_id)
                        if pattern[0]:
                            # going right
                            if current.right:
                                current = current.right
                            else:
                                current.right = Node(0, node_id)
                                current = current.right
                                node_id += 1
                        else:
                            # going left
                            if current.left:
                                current = current.left
                            else:
                                current.left = Node(0, node_id)
                                current = current.left
                                node_id += 1
                        pattern = pattern[1:]
                    current.key += 1 if query[0] == "+" else -1
                    #print(current.key, current.node_id)
                else:
                    pattern = [int(x) for x in "0" * (LVL - len(query[1])) + query[1]]
                    current = root
                    #print(pattern)
                    while pattern:
                        if pattern[0]:
                            # going right
                            if current.right:
                                current = current.right
                            else:
                                current = Node(0)
                                pattern = []
                        else:
                            # going left
                            if current.left:
                                current = current.left
                            else:
                                current = Node(0)
                                pattern = []
                        pattern = pattern[1:]
                    res.append(current.key)
        else:
            counts = defaultdict(int)
            for query in self.queries:

                if query[0] in "+-":
                    pattern = "0" * (LVL - len(query[1])) + "".join(("1" if int(x) % 2 else "0" for x in query[1]))
                    counts[pattern] += 1 if query[0] == "+" else -1
                else:
                    pattern = "0" * (LVL - len(query[1])) + query[1]
                    res.append(counts[pattern])

        self.result = "\n".join([str(x) for x in res])

    def get_result(self):
        return self.result


def __starting_point():
    Solution = CodeforcesTask713ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())

__starting_point()