#include <bits/stdc++.h>
using namespace std;
const int maxn = 701 + 10;
const long mod = 1e9 + 7;
char s[maxn];
int tmp[maxn], match[maxn];
long long dp[maxn][maxn][3][3];
void work(int len) {
  int t = 0;
  for (int i = 0; i < len; i++) {
    if (s[i] == '(')
      tmp[t++] = i;
    else {
      match[i] = tmp[t - 1];
      match[tmp[t - 1]] = i;
      t--;
    }
  }
}
void dfs(int l, int r) {
  if (l + 1 == r) {
    dp[l][r][0][1] = 1;
    dp[l][r][1][0] = 1;
    dp[l][r][0][2] = 1;
    dp[l][r][2][0] = 1;
    return;
  }
  if (match[l] == r) {
    dfs(l + 1, r - 1);
    for (int i = 0; i < 3; i++)
      for (int j = 0; j < 3; j++) {
        if (j != 1)
          dp[l][r][0][1] = (dp[l][r][0][1] + dp[l + 1][r - 1][i][j]) % mod;
        if (i != 1)
          dp[l][r][1][0] = (dp[l][r][1][0] + dp[l + 1][r - 1][i][j]) % mod;
        if (j != 2)
          dp[l][r][0][2] = (dp[l][r][0][2] + dp[l + 1][r - 1][i][j]) % mod;
        if (i != 2)
          dp[l][r][2][0] = (dp[l][r][2][0] + dp[l + 1][r - 1][i][j]) % mod;
      }
    return;
  } else {
    int t = match[l];
    dfs(l, t);
    dfs(t + 1, r);
    for (int i = 0; i < 3; i++)
      for (int j = 0; j < 3; j++)
        for (int x = 0; x < 3; x++)
          for (int y = 0; y < 3; y++)
            if (!((x == 1 && y == 1) || (x == 2 && y == 2)))
              dp[l][r][i][j] = (dp[l][r][i][j] +
                                (dp[l][t][i][x] * dp[t + 1][r][y][j]) % mod) %
                               mod;
  }
}
int main() {
  while (scanf("%s", s) != EOF) {
    int len = strlen(s);
    work(len);
    memset(dp, 0, sizeof(dp));
    dfs(0, len - 1);
    long long ans = 0;
    for (int i = 0; i < 3; i++)
      for (int j = 0; j < 3; j++) ans = (ans + dp[0][len - 1][i][j]) % mod;
    printf("%lld\n", ans);
  }
  return 0;
}
