// 2015-11-04
#include <iostream>
#include <bitset>
#include <vector>
#include <cstdio>
using namespace std;
int main() {
    int T;
    cin >> T;
    for (int _cs = 1; _cs <= T; _cs++) {
        int N;
        cin >> N;
        int sum = 0;
        vector<int> x(N);
        for (int i = 0; i < N; i++) {
            cin >> x[i];
            sum += x[i];
        }
        printf("Case %d: ", _cs);
        if (sum%2 || N%2) {
            puts("No");
            continue;
        }
        vector<bitset<41>> dp(sum+1);
        dp[0][0] = 1;
        for (int i = 0; i < N; i++) {
            for (int j = dp.size() -1; j >= x[i]; j--) {
                dp[j] |= dp[j-x[i]] << 1;
            }
        }
        puts(dp[sum/2][N/2] ? "Yes" : "No");
    }
}
 

Ly8gMjAxNS0xMS0wNAojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlIDxiaXRzZXQ+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxjc3RkaW8+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkgewogICAgaW50IFQ7CiAgICBjaW4gPj4gVDsKICAgIGZvciAoaW50IF9jcyA9IDE7IF9jcyA8PSBUOyBfY3MrKykgewogICAgICAgIGludCBOOwogICAgICAgIGNpbiA+PiBOOwogICAgICAgIGludCBzdW0gPSAwOwogICAgICAgIHZlY3RvcjxpbnQ+IHgoTik7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBOOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IHhbaV07CiAgICAgICAgICAgIHN1bSArPSB4W2ldOwogICAgICAgIH0KICAgICAgICBwcmludGYoIkNhc2UgJWQ6ICIsIF9jcyk7CiAgICAgICAgaWYgKHN1bSUyIHx8IE4lMikgewogICAgICAgICAgICBwdXRzKCJObyIpOwogICAgICAgICAgICBjb250aW51ZTsKICAgICAgICB9CiAgICAgICAgdmVjdG9yPGJpdHNldDw0MT4+IGRwKHN1bSsxKTsKICAgICAgICBkcFswXVswXSA9IDE7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBOOyBpKyspIHsKICAgICAgICAgICAgZm9yIChpbnQgaiA9IGRwLnNpemUoKSAtMTsgaiA+PSB4W2ldOyBqLS0pIHsKICAgICAgICAgICAgICAgIGRwW2pdIHw9IGRwW2oteFtpXV0gPDwgMTsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICBwdXRzKGRwW3N1bS8yXVtOLzJdID8gIlllcyIgOiAiTm8iKTsKICAgIH0KfQo=

MjM=

23