#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
const long long mod = (int)1e9 + 7;
int dx[] = {0, 0, -1, 1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
const int N = 1000001;
void stop() {}
void file() {}
struct point {
  long long x, y;
};
unsigned long long gcd(unsigned long long a, unsigned long long b) {
  return !b ? a : gcd(b, a % b);
}
long long fixMod(long long a, long long b) { return ((a % b) + b) % b; }
double triangle_area(int x1, int y1, int x2, int y2, int x3, int y3) {
  return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)) / 2.;
};
long long dis(pair<long long, long long> a, pair<long long, long long> b) {
  long long x = a.first - b.first, y = a.second - b.second;
  return abs(x) + abs(y);
}
unsigned long long LCM(unsigned long long a, unsigned long long b) {
  return a / gcd(a, b) * b;
}
long long power(long long x, long long y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  long long r = power(x, y / 2) % mod;
  return r % mod * r % mod * power(x, y % 2) % mod;
}
bool isPrime(long long x) {
  if (x <= 1) return 0;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) return 0;
  }
  return 1;
}
void solve() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  int a = 0;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '(')
      a++;
    else {
      if (a)
        a--;
      else {
        ans++;
      }
    }
  }
  cout << ans << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
