using System;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static void Main()
    {
        var s = rs();

        int ans = int.MinValue;

        for (int i = 0; i < s.Length; i++)
        {
            var t = s.Substring(i) + s.Substring(0, i);
            if (char.IsDigit(t[0]) && char.IsDigit(t[t.Length - 1]))
            {
                ans = Math.Max(ans, calc(t));
            }            
        }
        Console.WriteLine(ans);
    }

    static int calc(string s)
    {
        var num = s.Split('+', '-').Select(int.Parse).ToArray();
        var op = new Queue<char>();
        for (int i = 0; i < s.Length; i++)
            if (!char.IsDigit(s[i]))
                op.Enqueue(s[i]);
        int a = num[0];
        for (int i = 1; i < num.Length; i++)
        {
            var t = op.Dequeue();
            a += t == '+' ? num[i] : -num[i];
        }
        return a;
    }

    #region Scan
    static int ri() { return int.Parse(Console.ReadLine()); }
    static long rl() { return long.Parse(Console.ReadLine()); }
    static double rd() { return double.Parse(Console.ReadLine()); }
    static string rs() { return Console.ReadLine(); }
    static int[] ria() { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); }
    static long[] rla() { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); }
    static double[] rda() { return Console.ReadLine().Trim().Split().Select(double.Parse).ToArray(); }
    static string[] rsa() { return Console.ReadLine().Trim().Split(); }
    static void mul(out int a, out int b) { var arr = ria(); a = arr[0]; b = arr[1]; }
    static void mul(out int a, out int b, out int c) { var arr = ria(); a = arr[0]; b = arr[1]; c = arr[2]; }
    static void mul(out int a, out int b, out int c, out int d) { var arr = ria(); a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
    static void mul(out long a, out long b) { var arr = rla(); a = arr[0]; b = arr[1]; }
    static void mul(out long a, out long b, out long c) { var arr = rla(); a = arr[0]; b = arr[1]; c = arr[2]; }
    static void mul(out long a, out long b, out long c, out long d) { var arr = rla(); a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
    #endregion
    #region Math
    const int mod = 1000000007;
    static bool isprime(long n)
    {
        if (n < 2) return false;
        for (long i = 2; i * i <= n; i++)
            if (n % i == 0)
                return false;
        return true;
    }
    static long gcd(long a, long b) { return a == 0 ? b : gcd(b % a, a); }
    static long lcm(long a, long b) { return a * b / gcd(a, b); }
    #endregion
}