#include <bits/stdc++.h>
using namespace std;
const int maxn = 205, inf = 0x3f3f3f3f, mod = 1000000007;
char s[maxn];
long long dp[maxn][maxn][maxn];
int f[maxn];
void getfail(char *s) {
  f[0] = -1;
  int i = 0, j = -1, lens = strlen(s);
  while (i < lens) {
    if (j == -1 || s[i] == s[j])
      f[++i] = ++j;
    else
      j = f[j];
  }
}
void PutLeft(int i, int j, int k) {
  if (s[j] == '(')
    dp[i][j + 1][k + 1] = (dp[i][j + 1][k + 1] + dp[i - 1][j][k]) % mod;
  else {
    int p = j;
    while (p >= 0 && s[p] != '(') p = f[p];
    p++;
    dp[i][p][k + 1] = (dp[i][p][k + 1] + dp[i - 1][j][k]) % mod;
  }
}
void PutRight(int i, int j, int k) {
  if (s[j] == ')')
    dp[i][j + 1][k] = (dp[i][j + 1][k] + dp[i - 1][j][k + 1]) % mod;
  else {
    int p = j;
    while (p >= 0 && s[p] != ')') p = f[p];
    p++;
    dp[i][p][k] = (dp[i][p][k] + dp[i - 1][j][k + 1]) % mod;
  }
}
int main() {
  int n, m;
  scanf("%d %s", &n, s);
  m = strlen(s);
  getfail(s);
  dp[0][0][0] = 1;
  for (int i = 1; i <= 2 * n; ++i)
    for (int j = 0; j < (min(i, m) + 1); ++j)
      for (int k = 0; k < (i); ++k) {
        if (j < m) {
          PutLeft(i, j, k);
          PutRight(i, j, k);
        } else {
          dp[i][j][k + 1] = (dp[i][j][k + 1] + dp[i - 1][j][k]) % mod;
          dp[i][j][k] = (dp[i][j][k] + dp[i - 1][j][k + 1]) % mod;
        }
      }
  printf("%d\n", dp[2 * n][m][0]);
}
