#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) std::cout<<(p)<<std::endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
	
	string S;
	cin>>S;

	bool flag = false;
	int ans;
	int Max = S.size();
	int temp = 0;
	int tempAns = 0;
	int mode = 0;
	for(int i=0;i<Max;++i){

		temp = 0;
		tempAns = 0;
		mode = 0;
		for(int k=0;k<Max;++k){
			if( S[ (i+k)%Max ] == '+'){
				if(k==0 || k==(Max-1)){break;}
				mode = 1;
			}else
			if( S[ (i+k)%Max ] == '-'){
				if(k==0 || k==(Max-1)){break;}
				mode = -1;
			}
			else{
				temp = temp * 10 + S[ (i+k)%Max ] - '0';
				if(k==(Max-1)){
					if( mode == 1){
						tempAns += temp;
					}
					else if( mode == -1){
						tempAns -= temp;
					}
					if(flag == false){
						ans = tempAns;
						flag = true;
					}else{
						ans = ans>tempAns?ans:tempAns;
					}
				}
				else if(S[ (i+k+1)%Max ] == '+' || S[ (i+k+1)%Max ] == '-'){
					if( mode == 1){
						tempAns += temp;
					}
					else if( mode == -1){
						tempAns -= temp;
					}
					else if(mode == 0){
						tempAns = temp;
					}
					temp = 0;
				}
			}
		}
	}
	P(ans);
	return 0;
}