#include <bits/stdc++.h>
using namespace std;
const int N = 210, MOD = 1e9 + 7;
int n, m;
long long nxt[N], dp[N][N][N][2];
char s[N];
inline long long dfs(int now, int pos, int red, int fla) {
  if (red < 0 || red > n) return 0;
  if (!now) return !red && fla;
  if (~dp[now][pos][red][fla]) return dp[now][pos][red][fla];
  long long &ans = dp[now][pos][red][fla], t;
  ans = 0;
  for (t = pos; t && s[t + 1] != ')'; t = nxt[t])
    ;
  t += (s[t + 1] == ')');
  ans += dfs(now - 1, t, red - 1, fla | (t == m));
  for (t = pos; t && s[t + 1] != '('; t = nxt[t])
    ;
  t += (s[t + 1] == '(');
  ans += dfs(now - 1, t, red + 1, fla | (t == m));
  return ans %= MOD;
}
int main() {
  scanf("%d %s", &n, s + 1);
  m = strlen(s + 1);
  memset(dp, -1, sizeof(dp));
  for (int i = 2, j = 0; i <= m; i++) {
    while (j && s[j + 1] != s[i]) j = nxt[j];
    if (s[j + 1] == s[i]) j++;
    nxt[i] = j;
  }
  printf("%lld", dfs(2 * n, 0, 0, 0) % MOD);
  return 0;
}
