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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        static final int mod = (int) 1e9 + 7;
        int[][][][] f;
        boolean[][][][] was;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            String s = in.next();
            int n = s.length();
            int[] stack = new int[n];
            int stackSize = 0;
            int[] pair = new int[n];
            for (int i = 0; i < n; i++) {
                if (s.charAt(i) == '(') {
                    stack[stackSize++] = i;
                } else {
                    pair[stack[stackSize - 1]] = i;
                    pair[i] = stack[stackSize - 1];
                    --stackSize;
                }
            }
            f = new int[3][3][n][n];
            was = new boolean[3][3][n][n];
            for (int i = 0; i < 3; i++) {
                for (int j = 0; j < 3; j++) {
                    for (int pi = 0; pi < n; pi++) {
                        Arrays.fill(was[i][j][pi], false);
                    }
                }
            }
            out.println(solve(0, n - 1, 0, 0, pair, s));
        }

        int solve(int l, int r, int lstLeft, int lstRight, int[] pair, String s) {
            if (l >= r) {
                return 1;
            }
            if (r - l + 1 == 2) {
                was[lstLeft][lstRight][l][r] = true;
                f[lstLeft][lstRight][l][r] = 0;
                for (int i = 0; i < 3; i++) {
                    for (int j = 0; j < 3; j++) {
                        if (i > 0 && j > 0) {
                            continue;
                        }
                        if (i == 0 && j == 0) {
                            continue;
                        }
                        if (i > 0 && i == lstLeft) {
                            continue;
                        }
                        if (j > 0 && j == lstRight) {
                            continue;
                        }
                        f[lstLeft][lstRight][l][r]++;
                    }
                }
            }
            if (was[lstLeft][lstRight][l][r]) {
                return f[lstLeft][lstRight][l][r];
            }
            was[lstLeft][lstRight][l][r] = true;
            int myClose = pair[l];
            f[lstLeft][lstRight][l][r] = 0;
            int myLeft = lstLeft;
            int myRight = lstRight;
            if (myClose != r) {
                myRight = 0;
            }
            for (int i = 1; i < 3; i++) {
                boolean mayTake = true;
                if (i > 0 && i == myLeft) {
                    mayTake = false;
                }
                if (!mayTake) {
                    continue;
                }
                int ways = solve(l + 1, myClose - 1, i, 0, pair, s);
                ways = (int) ((1L * ways * solve(myClose + 1, r, 0, lstRight, pair, s)) % (1L * mod));
                f[lstLeft][lstRight][l][r] += ways;
                if (f[lstLeft][lstRight][l][r] >= mod) {
                    f[lstLeft][lstRight][l][r] -= mod;
                }
            }
            for (int i = 1; i < 3; i++) {
                boolean mayTake = true;
                if (i > 0 && i == myRight) {
                    mayTake = false;
                }
                if (!mayTake) {
                    continue;
                }
                int ways = solve(l + 1, myClose - 1, 0, i, pair, s);
                ways = (int) ((1L * ways * solve(myClose + 1, r, i, lstRight, pair, s)) % (1L * mod));
                f[lstLeft][lstRight][l][r] += ways;
                if (f[lstLeft][lstRight][l][r] >= mod) {
                    f[lstLeft][lstRight][l][r] -= mod;
                }
            }
            return f[lstLeft][lstRight][l][r];
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

    }
}