Problem: 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.

Input

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.

Output

Output lexicographically smallest sequence of variable values fit for feeding this golorp. Values should be listed in the order in which they get into the jaws. If the golorp is impossible to feed, output "false".

Examples

Input

?(_-_/___*__):-___&gt;__.


Output

0010


Input

?(__-_+_/_____):-__&gt;__,_____&lt;__.


Output

false


Input

?(______________________/____+_______*__-_____*______-___):-__&lt;___,___&lt;____,____&lt;_____,_____&lt;______,______&lt;_______.


Output

0250341


Input

?(__+___+__-___):-___&gt;__.


Output

0101

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  char s[1050], t[] = "?()+-*/%,.";
  gets(s);
  vector<int> e[1050];
  map<string, int> idx;
  int tag = 1, ans[1050] = {}, d[1050] = {}, v[1050] = {}, n = 0;
  for (auto i = strtok(s, t); i; i = strtok(0, t)) {
    string s = i;
    if (tag == 2) {
      int c = s.find_first_of("<>");
      int x = idx[s.substr(0, c)];
      int y = idx[s.substr(c + 1)];
      if (s[c] == '>') swap(x, y);
      e[x].push_back(y);
      d[y]++;
    }
    if (s == ":") tag = 2;
    if (tag == 1) {
      auto o = idx.insert({s, n++});
      if (o.second)
        v[n - 1] = n - 1;
      else
        v[n - 1] = o.first->second;
    }
  }
  set<int> u;
  for (int i = 0; i < n; i++)
    if (v[i] == i && !d[i]) u.insert(i);
  while (u.size()) {
    int x = *u.begin();
    u.erase(u.begin());
    for (int y : e[x]) {
      if (!--d[y]) u.insert(y);
      ans[y] = max(ans[y], ans[x] + 1);
    }
  }
  for (int i = 0; i < n; i++)
    if ((v[i] == i && d[i]) || ans[v[i]] >= 10) return puts("false"), 0;
  for (int i = 0; i < n; i++) printf("%d", ans[v[i]]);
  puts("");
}