time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You have been assigned to develop a filter for bad messages in the in-game chat. A message is a string SS of length nn, consisting of lowercase English letters and characters ')'. The message is bad if the number of characters ')' at the end of the string strictly greater than the number of remaining characters. For example, the string ")bc)))" has three parentheses at the end, three remaining characters, and is not considered bad.

Input

The first line contains the number of test cases tt (1≤t≤1001≤t≤100). Description of the tt test cases follows.

The first line of each test case contains an integer nn (1≤n≤1001≤n≤100). The second line of each test case contains a string SS of length nn, consisting of lowercase English letters and characters ')'.

Output

For each of tt test cases, print "Yes" if the string is bad. Otherwise, print "No".

You can print each letter in any case (upper or lower).

Example

input

Copy

5
2
))
12
gl))hf))))))
9
gege)))))
14
)aa))b))))))))
1
)

output

Copy

Yes
No
Yes
Yes
Yes

解题说明：水题，遍历统计即可。

#include<stdio.h>
#include<string.h>

int main()
{
	int i, t, n, index;
	char s[100];
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d\n", &n);
		gets(s);
		for (i = n - 1; i >= 0; i--) 
		{
			if (s[i] != ')')
			{
				break;
			}
		}
		if (i == -1)
		{
			printf("Yes\n");
		}
		else if (i + 1 < n - i - 1)
		{
			printf("Yes\n");
		}
		else
		{
			printf("No\n");
		}
	}
	return 0;
}