S = str(input())

def keisan(T):
    if T[0] == "+" or T[0] == "-" or T[-1] == "+" or T[-1] == "-":
        return -10**10
    N = []
    M = []
    s = ""
    for k in range(len(T)):
        if T[k] == "+":
            M.append("+")
            N.append(s)
            s = ""
        elif T[k] == "-":
            M.append("-")
            N.append(s)
            s = ""
        else:
            s += T[k]
    N.append(s)
    temp = int(N[0])
    for k in range(len(M)):
        if M[k] == "+":
            temp += int(N[k+1])
        elif M[k] == "-":
            temp -= int(N[k+1])
    return temp

ans = -10**10
for k in range(len(S)):
    ans = max(keisan(S[k:]+S[:k]),ans)

print(ans)