import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


string S;
int cur;

int expr() {
  int ret = term();
  for (; S[cur] == '+' || S[cur] == '-'; ) {
    const op = S[cur++];
    const tmp = term();
    ret = (op == '+') ? (ret + tmp) : (ret - tmp);
  }
  return ret;
}
int term() {
  int ret;
  if (S[cur] == '(') {
    ++cur;
    ret = expr();
    assert(S[cur] == ')');
    ++cur;
  } else if ('0' <= S[cur] && S[cur] <= '9') {
    ret = S[cur++] - '0';
  } else if (S[cur] == '-') {
    ++cur;
    ret = -term();
  } else {
    assert(false);
  }
  return ret;
}

void main() {
  try {
    for (; ; ) {
      S = readToken();
      
      S ~= '$';
      cur = 0;
      const ans = expr();
      assert(S[cur] == '$');
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}