Problem C - Parentheses Balance
-------------------------------

You are given a string consisting of parentheses () and []. A string of
this type is said to be correct:

(a) if it is the empty string 
(b) if A and B are correct, AB is correct, 
(c) if A is correct, (A) and [A] is correct. 

Write a program that takes a sequence of strings of this type and check
their correctness. Your program can assume that the maximum string
length is 128.

Input 
-----

The first line contains a positive integer N. N lines will follow, each
containing a string of parentheses () and [].

Output 
------

For each input string, output Yes or No followed by a newline.

Sample Input 
------------

3
([])
(([()])))
([()[]()])()

Output for Sample Input
-----------------------

Yes
No
Yes