#include <bits/stdc++.h>
using namespace std;
int n, len, nxt[202];
char ss[202];
long long dp[202][202][202][2], mod = 1000000007;
void getnxt() {
  for (int i = 2, j = 0; i <= len; i++) {
    while (j && ss[j + 1] != ss[i]) j = nxt[j];
    if (ss[j + 1] == ss[i]) j++;
    nxt[i] = j;
  }
}
long long dfs(int now, int pos, int sta, int flg) {
  if (sta < 0 || sta > n) {
    return 0;
  }
  if (!now) {
    return !sta && flg;
  }
  if (dp[now][pos][sta][flg] >= 0) {
    return dp[now][pos][sta][flg];
  }
  long long ans = 0;
  int tmp = pos;
  while (tmp && ss[tmp + 1] != ')') {
    tmp = nxt[tmp];
  }
  if (ss[tmp + 1] == ')') {
    tmp++;
  }
  ans = (ans + dfs(now - 1, tmp, sta - 1, flg | (tmp == len))) % mod;
  tmp = pos;
  while (tmp && ss[tmp + 1] != '(') {
    tmp = nxt[tmp];
  }
  if (ss[tmp + 1] == '(') {
    tmp++;
  }
  ans = (ans + dfs(now - 1, tmp, sta + 1, flg | (tmp == len))) % mod;
  dp[now][pos][sta][flg] = ans;
  return ans;
}
int main() {
  scanf("%d", &n);
  scanf("%s", ss + 1);
  len = strlen(ss + 1);
  memset(dp, -1, sizeof(dp));
  getnxt();
  printf("%lld\n", dfs(n * 2, 0, 0, 0));
  return 0;
}
