Parentheses Balance#2479

Parentheses Balance

1 second

128 megabytes

Very easy

A string consisting of parentheses $($ , $)$ and square brackets $[$ , $]$ is given. A bracket expression is considered correct if the following conditions are satisfied:

The string is empty;
If expressions $A$ and $B$ are correct, then their concatenation $A B$ is also correct;
If expression $A$ is correct, then $(A)$ and $[A]$ are also correct.

Write a program that determines whether a given bracket expression is correct. The length of each string does not exceed $128$ characters.

Input

The first line contains the number of test cases $n$ . Each of the following $n$ lines contains a bracket expression consisting only of the characters $($ , $)$ , $[$ , $]$ .

Output

For each test case, print Yes if the expression is correct, and No otherwise, each on a separate line.

Examples

Example 1

Loading