#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<int, pair<int, int> > &p1,
                  const pair<int, pair<int, int> > &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 2e5 + 5, inf = 2e18;
long long int can[3][3], par[1000], bad[3][3];
long long int dp[800][800][3][3];
long long int calc(int x, int y, int a, int b) {
  if (dp[x][y][a][b] != -1) return dp[x][y][a][b];
  if (par[x] == y) {
    if (!can[a][b]) {
      return dp[x][y][a][b] = 0;
    }
    if (y == x + 1) {
      return dp[x][y][a][b] = 1;
    }
    long long int ans = 0;
    for (long long int i = (long long int)0; i < (long long int)(3); i++) {
      if (!bad[i][a]) {
        for (long long int j = (long long int)0; j < (long long int)(3); j++) {
          if (!bad[j][b]) {
            ans += calc(x + 1, y - 1, i, j);
            ans %= MOD;
          }
        }
      }
    }
    return dp[x][y][a][b] = ans;
  }
  int p = par[x];
  long long int ans = 0;
  for (long long int i = (long long int)0; i < (long long int)(3); i++) {
    for (long long int j = (long long int)0; j < (long long int)(3); j++) {
      if (!bad[i][j]) {
        ans += (calc(x, p, a, i) * calc(p + 1, y, j, b)) % MOD;
        ans %= MOD;
      }
    }
  }
  return dp[x][y][a][b] = ans;
}
void solve() {
  string s;
  cin >> s;
  memset(dp, -1, sizeof dp);
  int n = s.length();
  stack<int> st;
  can[0][1] = can[1][0] = can[2][0] = can[0][2] = 1;
  bad[1][1] = bad[2][2] = 1;
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    if (s[i] == ')') {
      int t = st.top();
      par[t] = i;
      par[i] = t;
      st.pop();
    } else {
      st.push(i);
    }
  }
  long long int ans = 0;
  for (long long int i = (long long int)0; i < (long long int)(3); i++) {
    for (long long int j = (long long int)0; j < (long long int)(3); j++) {
      ans += calc(0, n - 1, i, j);
      ans %= MOD;
    }
  }
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
