Say Yes/No

Time Limit: 0.5 sec

 

The Problem

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.

 

The Input

The file contains a positive integer n and a sequence of n strings of parentheses ‘()’ and ‘[]’, one string a line.

 

The Output

For each test case print ‘Yes’ if the sequence are correct otherwise print ‘No’ in separate line.

 

Sample Input

3

([])

(([()])))

()

 

Sample Output

Yes

No

Yes

 

 

 

Inter University Mock Contest - 2016 [BGC Trust University Bangladesh]

Problem Setter:  Bishwajit Barua