#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <string>
#include <queue>
using namespace std;
int cul(string s){
int ans=0,k=0;
int l=s.size();
int ch=1;
int a[15]={0};
if(s[0]=='+' ||s[0]=='-' ||s[l-1]=='-' ||s[l-1]=='+') ans=-1000000000;

else{
for(int y=0;y<l;y++){
//cout<<ans<<endl;
if(s[y]-'0'>=0 &&s[y]-'0'<10){
k=k*10+s[y]-'0';

}
else if(s[y]=='+'){

if(ch==1) ans=ans+k;
else if(ch==-1) ans=ans-k;
k=0;
ch=1;
a[y]=1;

if(a[y-1]==1){
ans=-1000000000;
//break;
}
}


else if(s[y]=='-'){

if(ch==1) ans=ans+k;
else if(ch==-1) ans=ans-k;
k=0;
ch=-1;
a[y]=1;
if(a[y-1]==1){
ans=-1000000000;
//break;
}
}



}

if(ch==1) ans=ans+k;
else if(ch==-1) ans=ans-k;
}
return ans;

}


int main(){
//cout<<cul("10+4-1+15")<<endl;
string s;
cin>>s;
int l=s.length();
s=s+s;
int ans=-1000000000;
for(int i=0;i<l;i++){
if(cul(s.substr(i,l))>ans) ans=cul(s.substr(i,l));
//cout<<cul(s.substr(i,l))<<endl;
}

cout<<ans<<endl;
return 0;
}