#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
char s[210];
int f[210][110][210], g[210][2], n, m, nxt[210];
void get() {
  int j = 0;
  for (int i = 1; i <= m; i++) {
    while (j && s[j + 1] != s[i]) j = nxt[j];
    if (j < i - 1 && s[j + 1] == s[i]) j++;
    nxt[i] = j;
  }
  for (int i = 0; i < m; i++) {
    int a = i, b = i;
    while (a && s[a + 1] != '(') a = nxt[a];
    while (b && s[b + 1] != ')') b = nxt[b];
    if (s[a + 1] == '(') a++;
    if (s[b + 1] == ')') b++;
    g[i][0] = a;
    g[i][1] = b;
  }
  g[m][0] = g[m][1] = m;
}
int main() {
  scanf("%d", &n);
  scanf("%s", s + 1);
  m = strlen(s + 1);
  get();
  f[0][0][0] = 1;
  for (int i = 0; i < 2 * n; i++) {
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= m; k++) {
        f[i + 1][j + 1][g[k][0]] += f[i][j][k];
        f[i + 1][j + 1][g[k][0]] %= mod;
        if (j) {
          f[i + 1][j - 1][g[k][1]] += f[i][j][k];
          f[i + 1][j - 1][g[k][1]] %= mod;
        }
      }
    }
  }
  printf("%d", f[2 * n][0][m]);
  return 0;
}
