#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 50;
const int oo = 1e9;
const int mod = 1e9 + 7;
int n, m, dp[201][201][201], f[201];
string s;
int get(int k, char cur) {
  if (k == m) return k;
  while (k && cur != s[k]) k = f[k - 1];
  if (cur == s[k]) k++;
  return k;
}
int calc(int idx, int cur, int k) {
  if (cur < 0 || cur >= n) return 0;
  if (idx == n) return (k == m && !cur);
  int &res = dp[idx][cur][k];
  if (res != -1) return res;
  res = 0;
  res = (res + calc(idx + 1, cur + 1, get(k, '('))) % mod;
  res = (res + calc(idx + 1, cur - 1, get(k, ')'))) % mod;
  return res;
}
int main() {
  memset(dp, -1, sizeof(dp));
  cin >> n >> s;
  n *= 2;
  m = s.length();
  int j = 0;
  for (int i = 1; i < m; i++) {
    while (j && s[i] != s[j]) j = f[j - 1];
    if (s[i] == s[j]) j++;
    f[i] = j;
  }
  cout << calc(0, 0, 0) << endl;
}
