#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
char s[1010];
int N, pa[1010], st[1010], tp, f[1010][1010][3][3], ans;
inline int dp(int l, int r, int x, int y) {
  if (~f[l][r][x][y]) return f[l][r][x][y];
  if (l > r) return 0;
  if (r - l + 1 == 2)
    if ((x && !y) || (!x && y))
      return f[l][r][x][y] = 1;
    else
      return f[l][r][x][y] = 0;
  long long tmp = 0;
  if (pa[l] == r)
    if ((x && !y) || (!x && y))
      for (int xx = 0; xx <= 2; xx++)
        for (int yy = 0; yy <= 2; yy++)
          if (!(x && xx && xx == x) && !(y && yy && yy == y))
            tmp = (tmp + dp(l + 1, r - 1, xx, yy)) % 1000000007;
          else
            ;
    else
      return f[l][r][x][y] = 0;
  else
    for (int xx = 0; xx <= 2; xx++)
      for (int yy = 0; yy <= 2; yy++)
        if (!(xx == yy && xx))
          tmp = (tmp + (long long)dp(l, pa[l], x, xx) *
                           dp(pa[l] + 1, r, yy, y) % 1000000007) %
                1000000007;
  return f[l][r][x][y] = tmp;
}
int main() {
  scanf("%s", s + 1);
  N = strlen(s + 1);
  for (int i = 1; i <= N; i++)
    if (s[i] == '(')
      st[++tp] = i;
    else
      pa[i] = st[tp--];
  for (int i = 1; i <= N; i++)
    if (pa[i]) pa[pa[i]] = i;
  memset(f, -1, sizeof(f));
  for (int x = 0; x <= 2; x++)
    for (int y = 0; y <= 2; y++) ans = (ans + dp(1, N, x, y)) % 1000000007;
  printf("%d\n", ans);
  return 0;
}
