/** author: shobonvip created: 2025.04.09 20:59:28 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); auto check = [&](string &s) { int x = 0; rep(i,0,(int)s.size()) { if (s[i] == '(') { x++; }else{ x--; if(x < 0) return false; } } return x == 0; }; int n; cin >> n; if (n >= 20) assert(false); string s; cin >> s; ll ans = 0; rep(i,0,1 << n) { string t1 = ""; string t2 = ""; rep(j,0,n) { if (i >> j & 1) { t1 += s[j]; }else{ t2 += s[j]; } } if (check(t1) && check(t2)) { ans++; } } cout << ans << endl; }