Golorps are mysterious creatures who feed on variables. Golorp's name is a program in some programming language. Some scientists believe that this language is Befunge; golorps are tantalizingly silent.

Variables consumed by golorps can take values from 0 to 9, inclusive. For each golorp its daily diet is defined by its name. Some golorps are so picky that they can't be fed at all. Besides, all golorps are very health-conscious and try to eat as little as possible. Given a choice of several valid sequences of variable values, each golorp will choose lexicographically smallest one.

For the purposes of this problem you can assume that a golorp consists of jaws and a stomach. The number of variables necessary to feed a golorp is defined by the shape of its jaws. Variables can get to the stomach only via the jaws.

A hungry golorp is visiting you. You know its name; feed it or figure out that it's impossible.
The input is a single string (between 13 and 1024 characters long) — the name of the visiting golorp. All names are similar and will resemble the ones given in the samples. The name is guaranteed to be valid.
import re

line=input()

line = line.rstrip('.')
a, b, c = line.partition("):-")
rels = c.split(',')

relations = set()
for rel in rels:
    if "<" in rel:
        x, _, y = rel.partition("<")
        relations.add((len(x), len(y)))
    else:
        x, _, y = rel.partition(">")
        relations.add((len(y), len(x)))

a = a.lstrip("?(")
args = re.split(r"(\+|-|\*|/)", a)
args = [len(args[i]) for i in range(0, len(args), 2)]


# print(args)
# print(relations)

edges = {k:[] for k in args}
for j, i in relations:
    edges[i].append(j)

seen = {k:0 for k in args}

q = []

def topsort(k):
    if seen[k] == 1:
        print("false")
        quit()
    seen[k] = 1
    for other in edges[k]:
        topsort(other)
    q.append(k)
    seen[k] = 2
    return True

for k in args:
    if seen[k] == 0:
        topsort(k)

vals = {}

for k in q:
    others = edges[k]
    maxval = -1
    for other in others:
        maxval = max(maxval, vals.get(other, -1))
    vals[k] = maxval+1
    if(vals[k]>9):
        print("false")
        quit()

for k in args:
    print(vals[k], end='')

print()