Balanced Sequence

Problem Background

A corresponding multiple-choice / true-or-false problem: https://ti.luogu.com.cn/problemset/1159

Problem Description

Xiaoyang has a sequence $a$ of $n$ positive integers. He considers a sequence balanced if and only if there exists a positive integer $i$ ($1 \le i < n$) such that the sum of the first $i$ numbers equals the sum of the numbers from position $i+1$ to $n$.

Xiaoyang wants you to tell whether the sequence $a$ is balanced.

Input Format

This problem contains multiple test cases within a single test point. The first line is a positive integer $t$, the number of test cases.

This is followed by $t$ test cases. Each test case spans two lines:

• The first line contains a positive integer $n$, the length of the sequence.
• The second line contains $n$ positive integers, the elements of sequence $a$.

Output Format

For each test case output one line containing a string. If $a$ is balanced, output Yes; otherwise output No.

Sample Input

3
3
1 2 3
4
2 3 1 4
5
1 2 3 4 5

Sample Output

Yes
Yes
No

Sample Explanation

• For the first test case, taking $i = 2$ gives $1 + 2 = 3$, so the sequence is balanced.
• For the second test case, taking $i = 2$ gives $2 + 3 = 1 + 4$, so the sequence is balanced.
• For the third test case, no such $i$ exists.

Constraints

For all test data, $1 \le t \le 100$, $1 \le n, a_i \le 10000$.