#if __has_include("../library/Basic/Debug.hpp")

#include "../library/Basic/Debug.hpp"

#else

/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>
#include <cstdint>


/* ----- Type Alias ----- */
using Bool = bool;
using Int = long long int;
using Real = long double;
using Char = char;
using String = std::string;
template <class T, class U>
using Pair = std::pair<T, U>;
template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T>
using Vector = std::vector<T>;
template <size_t N>
using Bits = std::bitset<N>;
template <class T>
using Queue = std::queue<T>;
template <class T>
using Stack = std::stack<T>;
template <class T>
using Deque = std::deque<T>;

template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using Set = std::set<T>;
template <class T, class U>
using Map = std::map<T, U>;

template <class T, class... Us>
using Func = std::function<T(Us...)>;

template <class T>
T genv(T v) { return v; }

template <class T, class... Ts>
auto genv(size_t l, Ts... ts) {
    return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));
}

template <class Cost = Int>
struct Edge {
    Int src, dst;
    Cost cost;
    Edge(Int src = -1, Int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = Int>
using Edges = Vector<Edge<Cost>>;
template <class Cost = Int>
using Graph = Vector<Vector<Edge<Cost>>>;

#endif

/* ----- Misc ----- */
void fastio() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

struct Fout {
    Int precision;
    Fout(Int precision) : precision(precision) {}
};
std::ostream& operator<<(std::ostream& os, const Fout& fio) {
    os << std::fixed << std::setprecision(fio.precision);
    return os;
}


/* ----- Constants ----- */
constexpr Int INF = std::numeric_limits<Int>::max() / 3;
// constexpr Int MOD = 1000000007;
// constexpr Real PI = acos(-1);
// constexpr Real EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));

int main() {
    String s;
    std::cin >> s;
    Int n = s.length();

    std::function<Int(Int, Int)> maxdfs;

    std::function<Int(Int, Int)> mindfs = [&](Int l, Int r) {
        static Vector<Vector<Bool>> visited(n, Vector<Bool>(n, false));
        static Vector<Vector<Int>> dp(n, Vector<Int>(n));

        Int& ret = dp[l][r];
        if (visited[l][r]) return ret;

        visited[l][r] = true;
        ret = INF;

        // 単項
        if (l == r) {
            assert(std::isdigit(s[l]));
            ret = s[l] - '0';
        }

        // 複項
        // 両端に適当に括弧をつける
        while (s[l] == '(') ++l;
        while (s[r] == ')') --r;
        for (Int i = l; i <= r; ++i) {
            if (s[i] == '+') {
                Int a = mindfs(l, i - 1), b = mindfs(i + 1, r);
                ret = std::min(ret, a + b);
            } else if (s[i] == '-') {
                Int a = mindfs(l, i - 1), b = maxdfs(i + 1, r);
                ret = std::min(ret, a - b);
            }
        }
        return ret;
    };

    maxdfs = [&](Int l, Int r) {
        static Vector<Vector<Bool>> visited(n, Vector<Bool>(n, false));
        static Vector<Vector<Int>> dp(n, Vector<Int>(n));

        Int& ret = dp[l][r];
        if (visited[l][r]) return ret;

        visited[l][r] = true;
        ret = -INF;

        // 単項
        if (l == r) {
            assert(std::isdigit(s[l]));
            ret = s[l] - '0';
        }

        // 複項
        // 両端に適当に括弧をつける
        while (s[l] == '(') ++l;
        while (s[r] == ')') --r;
        for (Int i = l; i <= r; ++i) {
            if (s[i] == '+') {
                Int a = maxdfs(l, i - 1), b = maxdfs(i + 1, r);
                ret = std::max(ret, a + b);
            } else if (s[i] == '-') {
                Int a = maxdfs(l, i - 1), b = mindfs(i + 1, r);
                ret = std::max(ret, a - b);
            }
        }
        return ret;
    };

    std::cout << maxdfs(0, s.length() - 1) << std::endl;
    return 0;
}



Measured memory_bytes: 3692