#include <bits/stdc++.h>
using namespace std;
const int N = 1e5, MOD = 1e9 + 7;
int dp[205][205][205];
string s;
int f[205];
int failure(char c, int l) {
  while (l > 0 && c != s[l]) {
    l = f[l - 1];
  }
  return l + (c == s[l]);
}
void KMP() {
  for (int i = 1; s[i]; ++i) {
    f[i] = failure(s[i], f[i - 1]);
  }
}
int n;
int solve(int i = 0, int p = 0, int t = 0) {
  if (i == 2 * n) return (t == s.size() && !p);
  int &ret = dp[i][p][t];
  if (~ret) return ret;
  ret = 0;
  if (t == s.size()) {
    if (p) ret += solve(i + 1, p - 1, t);
    if (ret >= MOD) ret -= MOD;
    ret += solve(i + 1, p + 1, t);
    if (ret >= MOD) ret -= MOD;
  } else {
    if (s[t] == '(') {
      ret += solve(i + 1, p + 1, t + 1);
      if (ret >= MOD) ret -= MOD;
      if (p) {
        while (t && s[t] != ')') t = f[t - 1];
        ret += solve(i + 1, p - 1, t + (s[t] == ')'));
      }
      if (ret >= MOD) ret -= MOD;
    } else {
      if (p) ret += solve(i + 1, p - 1, t + 1);
      if (ret >= MOD) ret -= MOD;
      while (t && s[t] != '(') t = f[t - 1];
      ret += solve(i + 1, p + 1, t + (s[t] == '('));
      if (ret >= MOD) ret -= MOD;
    }
  }
  return ret;
}
int main() {
  memset(dp, -1, sizeof dp);
  cin >> n;
  cin >> s;
  KMP();
  printf("%d", solve());
  return 0;
}
