#include <bits/stdc++.h>
long long dp[703][703][4][4];
bool vis[703][703];
int main() {
  char s[703];
  scanf("%s", s);
  int n = strlen(s);
  memset(vis, false, sizeof(vis));
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i < n; i++) {
    if (s[i - 1] == '(' && s[i] == ')') {
      dp[i - 1][i][0][1] = 1;
      dp[i - 1][i][1][0] = 1;
      dp[i - 1][i][2][0] = 1;
      dp[i - 1][i][0][2] = 1;
      vis[i - 1][i] = true;
    }
  }
  for (int i = 1; i < n; i++)
    for (int j = 0; j + i < n; j++) {
      if (vis[j + 1][j + i - 1] && s[j] == '(' && s[j + i] == ')') {
        for (int x = 0; x <= 2; x++)
          for (int y = 0; y <= 2; y++) {
            if (y != 1)
              dp[j][j + i][0][1] =
                  (dp[j][j + i][0][1] + dp[j + 1][j + i - 1][x][y]) %
                  1000000007;
            if (y != 2)
              dp[j][j + i][0][2] =
                  (dp[j][j + i][0][2] + dp[j + 1][j + i - 1][x][y]) %
                  1000000007;
            if (x != 1)
              dp[j][j + i][1][0] =
                  (dp[j][j + i][1][0] + dp[j + 1][j + i - 1][x][y]) %
                  1000000007;
            if (x != 2)
              dp[j][j + i][2][0] =
                  (dp[j][j + i][2][0] + dp[j + 1][j + i - 1][x][y]) %
                  1000000007;
          }
        vis[j][j + i] = true;
      } else {
        for (int k = j; k < j + i; k++)
          if (vis[j][k] && vis[k + 1][j + i]) {
            vis[j][j + i] = true;
            for (int x = 0; x <= 2; x++)
              for (int y = 0; y <= 2; y++) {
                if (x == y && (x + y) != 0) continue;
                dp[j][j + i][0][0] = (dp[j][j + i][0][0] +
                                      dp[j][k][0][x] * dp[k + 1][j + i][y][0]) %
                                     1000000007;
                dp[j][j + i][0][1] = (dp[j][j + i][0][1] +
                                      dp[j][k][0][x] * dp[k + 1][j + i][y][1]) %
                                     1000000007;
                dp[j][j + i][0][2] = (dp[j][j + i][0][2] +
                                      dp[j][k][0][x] * dp[k + 1][j + i][y][2]) %
                                     1000000007;
                dp[j][j + i][1][0] = (dp[j][j + i][1][0] +
                                      dp[j][k][1][x] * dp[k + 1][j + i][y][0]) %
                                     1000000007;
                dp[j][j + i][1][1] = (dp[j][j + i][1][1] +
                                      dp[j][k][1][x] * dp[k + 1][j + i][y][1]) %
                                     1000000007;
                dp[j][j + i][1][2] = (dp[j][j + i][1][2] +
                                      dp[j][k][1][x] * dp[k + 1][j + i][y][2]) %
                                     1000000007;
                dp[j][j + i][2][0] = (dp[j][j + i][2][0] +
                                      dp[j][k][2][x] * dp[k + 1][j + i][y][0]) %
                                     1000000007;
                dp[j][j + i][2][1] = (dp[j][j + i][2][1] +
                                      dp[j][k][2][x] * dp[k + 1][j + i][y][1]) %
                                     1000000007;
                dp[j][j + i][2][2] = (dp[j][j + i][2][2] +
                                      dp[j][k][2][x] * dp[k + 1][j + i][y][2]) %
                                     1000000007;
              }
            break;
          }
      }
    }
  long long ans = 0;
  for (int i = 0; i <= 2; i++)
    for (int j = 0; j <= 2; j++) {
      ans = (ans + dp[0][n - 1][i][j]) % 1000000007;
    }
  printf("%d\n", ans);
  return 0;
}
