#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
const int LEN = 222;
string s;
int Next[LEN][2];
int dp[LEN][LEN / 2][LEN][2];
string pref_str[LEN];
void inc(int& v, int adder) {
  v += adder;
  v %= M;
}
int prefix_equal_suffix(string a, string b) {
  int len = b.length();
  for (int res = len; res >= 0; res--) {
    if (pref_str[res] == b) return res;
    b.erase(0, 1);
  }
}
int main() {
  int n;
  cin >> n;
  cin >> s;
  int slen = s.length();
  pref_str[0] = "";
  for (int pref = 1; pref <= slen; pref++) {
    pref_str[pref] = pref_str[pref - 1];
    pref_str[pref] += s[pref - 1];
  }
  string t = "";
  for (int pref = 0; pref <= slen; pref++) {
    if (pref) t += s[pref - 1];
    Next[pref][0] = prefix_equal_suffix(s, t + '(');
    Next[pref][1] = prefix_equal_suffix(s, t + ')');
  }
  dp[0][0][0][0] = 1;
  for (int len = 0; len < 2 * n; len++)
    for (int diff = 0; diff <= n; diff++)
      for (int pref = 0; pref <= slen; pref++)
        for (int have = 0; have < 2; have++) {
          if (!dp[len][diff][pref][have]) continue;
          if (diff < n) {
            int new_pref = Next[pref][0];
            int new_have = have | (new_pref == slen);
            inc(dp[len + 1][diff + 1][new_pref][new_have],
                dp[len][diff][pref][have]);
          }
          if (0 < diff) {
            int new_pref = Next[pref][1];
            int new_have = have | (new_pref == slen);
            inc(dp[len + 1][diff - 1][new_pref][new_have],
                dp[len][diff][pref][have]);
          }
        }
  int ans = 0;
  for (int i = 0; i <= slen; i++) inc(ans, dp[2 * n][0][i][1]);
  cout << ans;
}
