import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string; auto rdsp(){return readln.splitter;} void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;} void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);} void main() { long n; readV(n); string s; readV(s); auto a = new long[](n); foreach (i; 0..n) a[i] = s[i] == '(' ? 1 : -1; foreach (i; 1..n) a[i] = a[i-1] + a[i]; struct AM { long a, m; } auto am = new AM[](n), m = 0L; foreach (i; 0..n) { m = min(m, a[i]); am[i] = AM(a[i], m); } am.sort!((a, b) => a.m == b.m ? a.a > b.a : a.m > b.m); auto ami = am[0]; foreach (i; 1..n) { ami.m = min(ami.m, ami.a + am[i].m); ami.a += am[i].a; } writeln(n*(n+1)/2 - ami.a + ami.m*2); }