#include <bits/stdc++.h>
using namespace std;
const int maxN = 101, maxP = 201, Mod = 1e9 + 7;
static int f[maxN - 1 << 1][maxN][maxP][2], Next[maxP][2], m, n, p, tmp, ans;
string P;
inline void Add(int &x, int y) {
  if ((x += y) >= Mod) x -= Mod;
}
void Prepare() {
  cin >> n >> P;
  m = n << 1;
  p = P.size();
  for (char &c : P) c = c == '(';
  string t = "";
  for (int k = 0; k <= p; ++k) {
    t += 'B';
    for (int c = 0; c < 2; ++c) {
      t[k] = c;
      for (int len = min(k + 1, p); len >= 0; --len)
        if (t.substr(k + 1 - len, len) == P.substr(0, len)) {
          Next[k][c] = len;
          break;
        }
    }
    if (k < p) t[k] = P[k];
  }
}
void Solve() {
  tmp = Next[0][1];
  f[0][1][tmp][tmp == p] = 1;
  for (int i = 0, i1 = 1; i1 < m; ++i, ++i1)
    for (int k = 0; k <= p; ++k) {
      tmp = Next[k][1];
      for (int j = 0; j < n; ++j)
        Add(f[i1][j + 1][tmp][tmp == p], f[i][j][k][0]),
            Add(f[i1][j + 1][tmp][1], f[i][j][k][1]);
      tmp = Next[k][0];
      for (int j = 1; j <= n; ++j)
        Add(f[i1][j - 1][tmp][tmp == p], f[i][j][k][0]),
            Add(f[i1][j - 1][tmp][1], f[i][j][k][1]);
    }
  for (int k = 0; k <= p; ++k) Add(ans, f[m - 1][0][k][1]);
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  Prepare();
  Solve();
  return 0;
}
