Most C/C++ programmers know about excellent opportunities that preprocessor #define directives give; but many know as well about the problems that can arise because of their careless use.

In this problem we consider the following model of #define constructions (also called macros). Each macro has its name and value. The generic syntax for declaring a macro is the following:

#define macro_name macro_value

After the macro has been declared, "macro_name" is replaced with "macro_value" each time it is met in the program (only the whole tokens can be replaced; i.e. "macro_name" is replaced only when it is surrounded by spaces or other non-alphabetic symbol). A "macro_value" within our model can only be an arithmetic expression consisting of variables, four arithmetic operations, brackets, and also the names of previously declared macros (in this case replacement is performed sequentially). The process of replacing macros with their values is called substitution.

One of the main problems arising while using macros — the situation when as a result of substitution we get an arithmetic expression with the changed order of calculation because of different priorities of the operations.

Let's consider the following example. Say, we declared such a #define construction:

#define sum x + y

and further in the program the expression "2 * sum" is calculated. After macro substitution is performed we get "2 * x + y", instead of intuitively expected "2 * (x + y)".

Let's call the situation "suspicious", if after the macro substitution the order of calculation changes, falling outside the bounds of some macro. Thus, your task is to find out by the given set of #define definitions and the given expression if this expression is suspicious or not.

Let's speak more formally. We should perform an ordinary macros substitution in the given expression. Moreover, we should perform a "safe" macros substitution in the expression, putting in brackets each macro value; after this, guided by arithmetic rules of brackets expansion, we can omit some of the brackets. If there exist a way to get an expression, absolutely coinciding with the expression that is the result of an ordinary substitution (character-by-character, but ignoring spaces), then this expression and the macros system are called correct, otherwise — suspicious.

Note that we consider the "/" operation as the usual mathematical division, not the integer division like in C/C++. That's why, for example, in the expression "a*(b/c)" we can omit brackets to get the expression "a*b/c".

Input

The first line contains the only number n (0 ≤ n ≤ 100) — the amount of #define constructions in the given program.

Then there follow n lines, each of them contains just one #define construction. Each construction has the following syntax:

#define name expression

where

  * name — the macro name, 
  * expression — the expression with which the given macro will be replaced. An expression is a non-empty string, containing digits,names of variables, names of previously declared macros, round brackets and operational signs +-*/. It is guaranteed that the expression (before and after macros substitution) is a correct arithmetic expression, having no unary operations. The expression contains only non-negative integers, not exceeding 109. 



All the names (#define constructions' names and names of their arguments) are strings of case-sensitive Latin characters. It is guaranteed that the name of any variable is different from any #define construction.

Then, the last line contains an expression that you are to check. This expression is non-empty and satisfies the same limitations as the expressions in #define constructions.

The input lines may contain any number of spaces anywhere, providing these spaces do not break the word "define" or the names of constructions and variables. In particular, there can be any number of spaces before and after the "#" symbol.

The length of any line from the input file does not exceed 100 characters.

Output

Output "OK", if the expression is correct according to the above given criterion, otherwise output "Suspicious".

Examples

Input

1
#define sum x + y
1 * sum


Output

Suspicious


Input

1
#define sum  (x + y)
sum - sum


Output

OK


Input

4
#define sum  x + y
#define mul  a * b
#define div  a / b
#define expr sum + mul * div * mul
expr


Output

OK


Input

3
#define SumSafe   (a+b)
#define DivUnsafe  a/b
#define DenominatorUnsafe  a*b
((SumSafe) + DivUnsafe/DivUnsafe + x/DenominatorUnsafe)


Output

Suspicious
#!/usr/bin/env python

"""
CodeForces: 7E. Defining Macros

The key for the solution is the naked operators that are not surrounded by
the parentheses in the macro definition.

Suspicious patterns of the operators in the appearance order are:

    o{-}   n{+-}
    o{*}   n{+-}
    o{/}   n{+-*/}
    n{+-}  o{*}
    n{+-}  o{/}

where:
    "o{}": an operator before or after the macro might construct
        a suspicious expression with the operators in "n{}"
    "n{}": a subset of the naked operators in the macro definition
        that might construct a suspicious expression with the operator "o"

If the pair of operators in the "o{}" and "n{}" are matched
in the expression, the entire expression would be suspicious.
"""

# Represent the operator as the bit mask:
# Pseudo operator whose priority is lower than "+",
# Add (+), Subtract (-), Multiply (*) and Division (/)
P, A, S, M, D = 1, 2, 4, 8, 16
ADD = A | S
ANY = A | S | M | D
# Map of the operators (+-*/) to the bit mask
OP_BIT = {"+": A, "-": S, "*": M, "/": D, ")": 0}
# unsafe naked operators against the operator before and after the macro
UNSAFE_BEFORE = {P: 0, A: 0, S: ADD, M: ADD, D: ANY}
UNSAFE_AFTER = {P: 0, A: 0, S: 0, M: ADD, D: ADD}

# Macro definitions:
# a map from the macro name to the set of its naked operators
# Note: the set is represented as a bit pattern
macro = dict()


# Parse expression with checking suspicious expression
def expr(chars,
         # following arguments are the short cut
         pseudo=P,
         expand=macro.get,
         op_bit=OP_BIT,
         unsafe_before=UNSAFE_BEFORE,
         unsafe_after=UNSAFE_AFTER):
    # stack of the operator before the left parenthesis "("
    paren = []
    push = paren.append
    pop = paren.pop
    # list of characters that would be a macro name or a number
    name = []
    keep = name.append
    forget = name.clear

    # last_op: last operator before the macro name or the number
    # retval: set of the naked operators of this expression
    # naked: set of the naked operators of the macro expanded
    last_op = retval = naked = pseudo

    # expand the macro and check the preceding operator
    def safe():
        nonlocal naked
        naked = expand("".join(name), pseudo)
        forget()
        # early exit for a suspicious expression and a value
        if naked <= pseudo:
            return naked
        # safety check against the operator before the macro
        return not (unsafe_before[last_op] & naked)

    # parse the expression
    for c in chars:
        if c == "(":
            push(last_op)
            last_op = pseudo
        elif c not in op_bit:
            keep(c)
        elif not safe():
            return 0
        elif c == ")":
            last_op = pop()
        else:
            # safety check against the operator after the macro
            last_op = op_bit[c]
            if unsafe_after[last_op] & naked:
                return 0
            # record operators not surrounded by the parentheses
            if not paren:
                retval |= last_op

    if name and not safe():
        return 0
    return retval


def main():
    global macro

    def chars(b, t):
        for k in range(b, len(t)):
            yield from t[k]

    for _ in range(int(input())):
        token = input().split()
        s = token[0] == "#"
        macro[token[1 + s]] = expr(chars(2 + s, token))

    print("OK" if expr((c for c in input() if c != " ")) else "Suspicious")



if __name__ == '__main__':
    main()
