PROGRAMMING:Bracket pairing problem
###Task description
```
Now, there is a sequence of brackets. Please check whether the brackets are paired.
```
###Input format:
```
In the first line, enter a number n (0 < n < = 100), indicating that there are n groups of test data. The following N lines input multiple groups of input data, each group of input data is a string s (the length of S is less than 10000, and S is not an empty string), and the number of test data groups is less than 5. Data guarantee s only contains "[", "]", "(", ")" four characters
```
###Output format:
```
The output of each group of input data occupies one line. If the brackets contained in the string are paired, yes will be output. If not, no will be output
```
###Input example:
```in
three
[(])
(])
([[]()])
```
###Output example:
```out
No
No
Yes
```
###Title Source
This topic is selected from nyoj website, online address: http://nyoj.top/problem/2
answer：If there is no answer, please comment
```
Now, there is a sequence of brackets. Please check whether the brackets are paired.
```
###Input format:
```
In the first line, enter a number n (0 < n < = 100), indicating that there are n groups of test data. The following N lines input multiple groups of input data, each group of input data is a string s (the length of S is less than 10000, and S is not an empty string), and the number of test data groups is less than 5. Data guarantee s only contains "[", "]", "(", ")" four characters
```
###Output format:
```
The output of each group of input data occupies one line. If the brackets contained in the string are paired, yes will be output. If not, no will be output
```
###Input example:
```in
three
[(])
(])
([[]()])
```
###Output example:
```out
No
No
Yes
```
###Title Source
This topic is selected from nyoj website, online address: http://nyoj.top/problem/2
answer：If there is no answer, please comment