#include <bits/stdc++.h>
using namespace std;
const int Max = 1e9 + 100;
const long long int MAX = 2e18 + 500;
const int sz = 210;
const long long int mod = 1e9 + 7;
string str;
int table[sz];
int len;
long long int dp[sz][sz][sz];
long long int n;
long long int cholo(long long int id, long long int cur, long long int sum) {
  if (id >= n) {
    if (cur >= len && sum == 0)
      return 1ll;
    else
      return 0;
  }
  long long int &ret = dp[id][cur][sum];
  if (~ret) return ret;
  long long int tot = 0;
  if (sum > 0) {
    long long int temp = cur;
    if (temp < len) {
      while (true) {
        if (str[temp] == ')') {
          ++temp;
          break;
        } else if (temp > 0)
          temp = table[temp - 1];
        else
          break;
      }
    }
    tot = cholo(id + 1, temp, sum - 1);
  }
  long long int temp = cur;
  if (temp < len) {
    while (true) {
      if (str[temp] == '(') {
        ++temp;
        break;
      } else if (temp > 0)
        temp = table[temp - 1];
      else
        break;
    }
  }
  tot = (tot + cholo(id + 1, temp, sum + 1)) % mod;
  return (ret = tot);
}
void failure() {
  table[0] = 0;
  int i = 1, j = 0;
  while (i < len) {
    if (str[i] == str[j]) {
      table[i++] = ++j;
    } else {
      if (j > 0)
        j = table[j - 1];
      else
        table[i++] = 0;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  char ch;
  double d;
  bool bl, bl1;
  int t, cs = 1;
  cin >> n >> str;
  n *= 2ll;
  len = str.length();
  failure();
  memset(dp, -1ll, sizeof dp);
  long long int ans = cholo(0, 0, 0);
  cout << ans << '\n';
}
