#include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                     #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,int>
                            #define ppa pair<int,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
                            double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }

                            //----------------kokomade tenpure------------

void no(){
	cout<<"No"<<endl;
	return;
}

int beki(int r, int k){
	if(k==0) return 1;
	else return r*beki(r,k-1);
}
int a[100010];
int op[100010];
int dp[100010][3];
 signed  main(){
int n;
 	cin>>n;
 	for(int i=0;i<100010;i++)for(int j=0;j<3;j++) dp[i][j]= -inf*1000000000ll;
 	for(int i=0;i<n-1;i++){
 		int dd;
 		string sa;
 		cin>>dd>>sa;
 		a[i+1]=dd;
 		if(sa=="+")op[i+1]=1;
 		else op[i+1]=-1;
 	}
 	cin>>a[n];
 	op[0]=1;
 	dp[0][0]=0;
 	
 	for(int i=1;i<=n;i++){
 		if(op[i-1]==1){
 			dp[i][0]=max(dp[i][0],dp[i-1][0]+a[i]);
 			dp[i][0]=max(dp[i][0],dp[i-1][1]+a[i]);
 			dp[i][1]=max(dp[i][1],dp[i-1][1]-a[i]);
 			dp[i][1]=max(dp[i][1],dp[i-1][2]-a[i]);
 			dp[i][2]=max(dp[i][2],dp[i-1][2]+a[i]);
 		}
 		else{
 	//		dp[i][0]=max(dp[i][0],dp[i-1][0]-a[i]);
 	//		dp[i][0]=max(dp[i][0],dp[i-1][1]-a[i]);
 			dp[i][1]=max(dp[i][1],dp[i-1][0]-a[i]);
 			dp[i][1]=max(dp[i][1],dp[i-1][1]-a[i]);
 			dp[i][1]=max(dp[i][1],dp[i-1][2]-a[i]);
 			dp[i][2]=max(dp[i][2],dp[i-1][1]+a[i]);
 			dp[i][2]=max(dp[i][2],dp[i-1][2]+a[i]);
 		}
 //		cout<<dp[i][0]<<" "<<dp[i][1]<<" "<<dp[i][2]<<" "<<endl;
 		
 	}
 	cout<<max(dp[n][0],max(dp[n][1],dp[n][2]))<<endl;
 	
                   //  	printf("%.10f\n",ans[n-1]);
                    	return 0;
}

Measured memory_bytes: 4096