#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
string S;

int dp[202020][50];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>S;
	FOR(i,N+2) FOR(j,50) dp[i][j]=-1<<20;
	dp[0][0]=0;
	FOR(i,N) {
		int add[2]={1,1};
		if(S[i]=='+') add[1]=-1;
		if(S[i]=='-') add[0]=-1;
		FOR(j,49) {
			//same
			int d=dp[i][j]+add[j%2];
			if(d>=0) chmax(dp[i+1][j],d);
			//other
			d=dp[i][j]+add[(j+1)%2];
			if(d>=0) chmax(dp[i+1][j+1],d);
		}
	}
	FOR(i,49) if(dp[N][i]>=0) {
		cout<<(i+1)/2<<endl;
		return;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}