#include #define MOD 1000000007 #define pe(str) return cout<<(str)<=0;i--) #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b);i>=(a);i--) #define bw(a,b,c) (((a)<=(b))&&((b)<=(c))) #define hello cout<<"hello"< pii; typedef complex point; template void dump(InputIterator first,InputIterator last,char delim=' '){ for(InputIterator it=first;it!=last;it++){ if(it!=first)cout< void swp(T &a,T &b){ T t=a; a=b; b=t; } int main(void){ string s,g; string a[2]; int ans=-2000000000; cin>>s; g=s; do{ rotate(s.begin(),s.begin()+1,s.end()); db(s); if(!bw(0,s[0]-'0',9) || !bw(0,s[s.size()-1]-'0',9))continue; int t=0; char op; a[0]=""; a[1]=""; re(i,s.size()){ if(s[i]!='-'&&s[i]!='+') a[t]+=s[i]; else{ t++; if(t==2){ t=1; a[0]=to_string((op=='+'?stoi(a[0])+stoi(a[1]):stoi(a[0])-stoi(a[1]))); a[1]=""; } op=s[i]; } } if(t==1)a[0]=to_string((op=='+'?stoi(a[0])+stoi(a[1]):stoi(a[0])-stoi(a[1]))); ans=max(ans,stoi(a[0])); }while(g!=s); cout<