This is the easy version of the problem. The difference between the versions is that in this version, you only need to evaluate for whole string (s), (s) is regular , and the constraints on (n) are higher . We say that a bracket sequence (a) is better than a bracket sequence (b) if one of the following holds: (b) is a prefix of (a), but (a \ne b); or let (i) be the first position (if it exists) where (a_i \neq b_i), then (\color{red}{a_i = (}) and (\color{red}{b_i = )}). You are given a regular bracket sequence (^{\text{∗}}) (s) of even length (n). Among all non-empty subsequences (^{\text{†}}) (t) of (s) that are regular bracket sequences , find the maximum possible length of (t) such that (t) is better than (s). If no such (t) exists, report it. (^{\text{∗}})A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting the characters (1) and (+) between the original characters of the sequence. For example: bracket sequences (()()) and ((())) are regular (the resulting expressions are ((1)+(1)) and (((1+1)+1))); bracket sequences ()(), ((), and ()) are not. (^{\text{†}})A sequence (a) is a subsequence of a sequence (b) if (a) can be obtained from (b) by the deletion of several (possibly, zero or all) element from arbitrary positions. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((2 \le n \le 2 \cdot 10^5), (n) is even) — the length of the string (s). The second line of each test case contains a sequence (s) of length (n) consisting only of character