Problem: Petya wrote a programme on C++ that calculated a very interesting function f(n). Petya ran the program with a certain value of n and went to the kitchen to have some tea. The history has no records concerning how long the program had been working. By the time Petya returned, it had completed the calculations and had the result. However while Petya was drinking tea, a sly virus managed to destroy the input file so that Petya can't figure out for which value of n the program was run. Help Petya, carry out the inverse function!

Mostly, the program consists of a function in C++ with the following simplified syntax:

  * function ::= int f(int n) {operatorSequence}
  * operatorSequence ::= operator | operator operatorSequence
  * operator ::= return arithmExpr; | if (logicalExpr) return arithmExpr;
  * logicalExpr ::= arithmExpr > arithmExpr | arithmExpr < arithmExpr | arithmExpr == arithmExpr
  * arithmExpr ::= sum
  * sum ::= product | sum + product | sum - product
  * product ::= multiplier | product * multiplier | product / multiplier
  * multiplier ::= n | number | f(arithmExpr)
  * number ::= 0|1|2|... |32767



The whitespaces in a operatorSequence are optional.

Thus, we have a function, in which body there are two kinds of operators. There is the operator "return arithmExpr;" that returns the value of the expression as the value of the function, and there is the conditional operator "if (logicalExpr) return arithmExpr;" that returns the value of the arithmetical expression when and only when the logical expression is true. Guaranteed that no other constructions of C++ language — cycles, assignment operators, nested conditional operators etc, and other variables except the n parameter are used in the function. All the constants are integers in the interval [0..32767].

The operators are performed sequentially. After the function has returned a value other operators in the sequence are not performed. Arithmetical expressions are performed taking into consideration the standard priority of the operations. It means that first all the products that are part of the sum are calculated. During the calculation of the products the operations of multiplying and division are performed from the left to the right. Then the summands are summed, and the addition and the subtraction are also performed from the left to the right. Operations ">" (more), "<" (less) and "==" (equals) also have standard meanings.

Now you've got to pay close attention! The program is compiled with the help of 15-bit Berland C++ compiler invented by a Berland company BerSoft, that's why arithmetical operations are performed in a non-standard way. Addition, subtraction and multiplication are performed modulo 32768 (if the result of subtraction is negative, then 32768 is added to it until the number belongs to the interval [0..32767]). Division "/" is a usual integer division where the remainder is omitted.

Examples of arithmetical operations: 

<image>

Guaranteed that for all values of n from 0 to 32767 the given function is performed correctly. That means that:

1. Division by 0 never occures.

2. When performing a function for the value n = N recursive calls of the function f may occur only for the parameter value of 0, 1, ..., N - 1. Consequently, the program never has an infinite recursion.

3. As the result of the sequence of the operators, the function always returns a value.

We have to mention that due to all the limitations the value returned by the function f is independent from either global variables or the order of performing the calculations of arithmetical expressions as part of the logical one, or from anything else except the value of n parameter. That's why the f function can be regarded as a function in its mathematical sense, i.e. as a unique correspondence between any value of n from the interval [0..32767] and a value of f(n) from the same interval.

Given the value of f(n), and you should find n. If the suitable n value is not unique, you should find the maximal one (from the interval [0..32767]).

Input

The first line has an integer f(n) from the interval [0..32767]. The next lines have the description of the function f. In the description can be found extra spaces and line breaks (see the examples) which, of course, can’t break key words int, if, return and numbers. The size of input data can’t exceed 100 bytes.

Output

Output a single number — the answer to the problem. If there’s no answer, output "-1" (without quotes).

Examples

Input

17
int f(int n)
{
if (n &lt; 100) return 17;
if (n &gt; 99) return 27;
}


Output

99


Input

13
int f(int n)
{
if (n == 0) return 0;
return f(n - 1) + 1;
}


Output

13

Input

144
int f(int n)
{
if (n == 0) return 0;
if (n == 1) return n;
return f(n - 1) + f(n - 2);
}

Output

24588

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int M = 32768;
enum { IF_RET, RET, GT, LT, EQ, ADD, SUB, MUL, DIV, VAR, NUM, FUNC };
int fs[M];
struct Node {
  int op, v;
  Node *pt0, *pt1;
  Node() {}
  void set(int _op, int _v, Node *_pt0, Node *_pt1) {
    op = _op, v = _v, pt0 = _pt0, pt1 = _pt1;
  }
  int calc(int n) {
    switch (op) {
      case GT:
        return (pt0->calc(n) > pt1->calc(n));
      case LT:
        return (pt0->calc(n) < pt1->calc(n));
      case EQ:
        return (pt0->calc(n) == pt1->calc(n));
      case ADD:
        return (pt0->calc(n) + pt1->calc(n)) % M;
      case SUB:
        return (pt0->calc(n) + M - pt1->calc(n)) % M;
      case MUL:
        return (pt0->calc(n) * pt1->calc(n)) % M;
      case DIV:
        return (pt0->calc(n) / pt1->calc(n)) % M;
      case VAR:
        return n;
      case NUM:
        return v;
      case FUNC:
        return fs[pt0->calc(n)];
    }
    return -1;
  }
  void print() {
    switch (op) {
      case IF_RET:
        printf("if (");
        pt0->print();
        printf(") return ");
        pt1->print();
        puts(";");
        break;
      case RET:
        printf("return ");
        pt0->print();
        puts(";");
        break;
      case GT:
        pt0->print();
        printf(">");
        pt1->print();
        break;
      case LT:
        pt0->print();
        printf("<");
        pt1->print();
        break;
      case EQ:
        pt0->print();
        printf("==");
        pt1->print();
        break;
      case ADD:
        pt0->print();
        printf("+");
        pt1->print();
        break;
      case SUB:
        pt0->print();
        printf("-");
        pt1->print();
        break;
      case MUL:
        pt0->print();
        printf("*");
        pt1->print();
        break;
      case DIV:
        pt0->print();
        printf("/");
        pt1->print();
        break;
      case VAR:
        putchar('n');
        break;
      case NUM:
        printf("%d", v);
        break;
      case FUNC:
        printf("f(");
        pt0->print();
        printf(")");
        break;
    }
  }
};
typedef vector<Node *> vnpt;
char s[8], ss[128][8];
Node buf[128], *bpt = buf;
int readword(char *cpt) {
  int c = getchar();
  while (c <= ' ') c = getchar();
  *(cpt++) = c;
  int l = 1;
  if (!islower(c) && !isdigit(c)) {
    *cpt = '\0';
    return l;
  }
  while (islower(c = getchar()) || isdigit(c)) {
    *(cpt++) = c;
    l++;
  }
  *cpt = '\0';
  ungetc(c, stdin);
  return l;
}
Node *expr(int &pos);
Node *multiplier(int &pos) {
  Node *npt = bpt++;
  if (ss[pos][0] == 'n') {
    npt->set(VAR, 0, NULL, NULL);
    pos++;
  } else if (isdigit(ss[pos][0])) {
    npt->set(NUM, atoi(ss[pos]), NULL, NULL);
    pos++;
  } else {
    pos += 2;
    Node *npt0 = expr(pos);
    pos++;
    npt->set(FUNC, 0, npt0, NULL);
  }
  return npt;
}
Node *product(int &pos) {
  Node *npt = multiplier(pos);
  while (ss[pos][0] == '*' || ss[pos][0] == '/') {
    char op = ss[pos++][0];
    Node *npt0 = npt;
    Node *npt1 = multiplier(pos);
    npt = bpt++;
    npt->set((op == '*') ? MUL : DIV, 0, npt0, npt1);
  }
  return npt;
}
Node *expr(int &pos) {
  Node *npt = product(pos);
  while (ss[pos][0] == '+' || ss[pos][0] == '-') {
    char op = ss[pos++][0];
    Node *npt0 = npt;
    Node *npt1 = product(pos);
    npt = bpt++;
    npt->set((op == '+') ? ADD : SUB, 0, npt0, npt1);
  }
  return npt;
}
Node *lexpr(int &pos) {
  Node *npt0 = expr(pos);
  char op = ss[pos++][0];
  if (op == '=') pos++;
  Node *npt1 = expr(pos);
  Node *npt = bpt++;
  npt->set((op == '>') ? GT : (op == '<') ? LT : EQ, 0, npt0, npt1);
  return npt;
}
void parse_func(vnpt &fv, int &pos) {
  fv.clear();
  pos += 7;
  while (ss[pos][0] != '}') {
    Node *npt = bpt++;
    if (ss[pos][0] == 'i') {
      pos += 2;
      Node *npt0 = lexpr(pos);
      pos += 2;
      Node *npt1 = expr(pos);
      pos++;
      npt->set(IF_RET, 0, npt0, npt1);
    } else {
      pos++;
      Node *npt0 = expr(pos);
      pos++;
      npt->set(RET, 0, npt0, NULL);
    }
    fv.push_back(npt);
  }
}
int calc_f(vnpt &fv, int n) {
  for (vnpt::iterator vit = fv.begin(); vit != fv.end(); vit++) {
    Node *npt = *vit;
    if (npt->op == IF_RET) {
      int le = npt->pt0->calc(n);
      if (le) return npt->pt1->calc(n);
    } else
      return npt->pt0->calc(n);
  }
  return 0;
}
int main() {
  int fn;
  scanf("%d", &fn);
  for (int k = 0; readword(ss[k]) && ss[k][0] != '}'; k++)
    ;
  vnpt fv;
  int pos = 0;
  parse_func(fv, pos);
  int ans = -1;
  for (int n = 0; n < M; n++) {
    fs[n] = calc_f(fv, n);
    if (fs[n] == fn) ans = n;
  }
  printf("%d\n", ans);
  return 0;
}