#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { int n; string s; cin >> n >> s; ll ans=0; ll x=0,y=0,c=0; P a[n]; rep(i,n) { if(s[i]=='(') { x++; } else { if(x) { c++; x--; } else y++; } ans+=c*2; a[i]=P(y,-x); } sort(a,a+n); ll ans2=0; rep(ii,min(3,n)) { vector

v; rep(i,n) { if(i==ii) continue; v.pb(a[i]); } sort(all(v)); x=-a[ii].S; ll sum=0; rep(i,v.size()) { ll z=min(x,v[i].F); sum+=z; x-=z; x-=v[i].S; } ans2=max(ans2,sum*2); } pr(ans+ans2); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}