Problem: Once Petya read a problem about a bracket sequence. He gave it much thought but didn't find a solution. Today you will face it.

You are given string s. It represents a correct bracket sequence. A correct bracket sequence is the sequence of opening ("(") and closing (")") brackets, such that it is possible to obtain a correct mathematical expression from it, inserting numbers and operators between the brackets. For example, such sequences as "(())()" and "()" are correct bracket sequences and such sequences as ")()" and "(()" are not.

In a correct bracket sequence each bracket corresponds to the matching bracket (an opening bracket corresponds to the matching closing bracket and vice versa). For example, in a bracket sequence shown of the figure below, the third bracket corresponds to the matching sixth one and the fifth bracket corresponds to the fourth one.

<image>

You are allowed to color some brackets in the bracket sequence so as all three conditions are fulfilled: 

  * Each bracket is either not colored any color, or is colored red, or is colored blue. 
  * For any pair of matching brackets exactly one of them is colored. In other words, for any bracket the following is true: either it or the matching bracket that corresponds to it is colored. 
  * No two neighboring colored brackets have the same color. 



Find the number of different ways to color the bracket sequence. The ways should meet the above-given conditions. Two ways of coloring are considered different if they differ in the color of at least one bracket. As the result can be quite large, print it modulo 1000000007 (109 + 7).

Input

The first line contains the single string s (2 ≤ |s| ≤ 700) which represents a correct bracket sequence. 

Output

Print the only number — the number of ways to color the bracket sequence that meet the above given conditions modulo 1000000007 (109 + 7).

Examples

Input

(())


Output

12


Input

(()())


Output

40


Input

()


Output

4

Note

Let's consider the first sample test. The bracket sequence from the sample can be colored, for example, as is shown on two figures below. 

<image> <image>

The two ways of coloring shown below are incorrect. 

<image> <image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize(2)
namespace ucp {
template <typename T>
void Min(T& a, T b) {
  if (a > b) a = b;
}
template <typename T>
void Max(T& a, T b) {
  if (a < b) a = b;
}
inline int read() {
  int sign, data = 0;
  char ch = 0;
  while ((ch != '-') && ch < '0' || ch > '9') ch = getchar();
  if (ch == '-') {
    sign = -1;
    ch = getchar();
  } else
    sign = 1;
  while (ch >= '0' && ch <= '9') {
    data = data * 10 + ch - '0';
    ch = getchar();
  }
  return data * sign;
}
inline void print(int x) {
  if (x / 10) print(x / 10);
  putchar(x % 10 + '0');
}
}  // namespace ucp
using namespace std;
using namespace ucp;
const int mxint = 0x3f3f3f3f;
const long long mxll = 1e16;
const int lim = 5e5 + 10;
const int maxn = 700 + 10;
const int maxm = 4e5 + 10;
const int N = 3e4 + 1000;
const long long mod = 1e9 + 7;
int n, t, m, x;
char s[maxn];
int ls;
int sta[maxn], top;
int match[maxn];
long long dp[maxn][maxn][3][3];
void getmatch() {
  for (int i = 0; i < ls; ++i) {
    if (s[i] == '(')
      sta[++top] = i;
    else if (top) {
      match[sta[top]] = i;
      match[i] = sta[top];
      --top;
    }
  }
}
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 (j != 2)
          dp[l][r][0][2] = (dp[l][r][0][2] + 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 (i != 2)
          dp[l][r][2][0] = (dp[l][r][2][0] + dp[l + 1][r - 1][i][j]) % mod;
      }
    }
  } else {
    int lr = match[l];
    dfs(l, lr);
    dfs(lr + 1, r);
    for (int i = 0; i < 3; ++i)
      for (int j = 0; j < 3; ++j)
        for (int k = 0; k < 3; ++k)
          for (int p = 0; p < 3; ++p) {
            if (!((j == 1 && k == 1) || (j == 2 && k == 2)))
              dp[l][r][i][p] = (dp[l][r][i][p] +
                                dp[l][lr][i][j] * dp[lr + 1][r][k][p] % mod) %
                               mod;
          }
  }
}
int main() {
  while (scanf("%s", s) != EOF) {
    memset(dp, 0, sizeof(dp));
    top = 0;
    ls = strlen(s);
    getmatch();
    dfs(0, ls - 1);
    long long ans = 0;
    for (int i = 0; i < 3; ++i)
      for (int j = 0; j < 3; ++j) {
        ans += dp[0][ls - 1][i][j];
        ans %= mod;
      }
    printf("%lld\n", ans);
  }
  return 0;
}