Problem:
Exhaustive Search

Write a program which reads a sequence A of n elements and an integer M, and outputs "yes" if you can make M by adding elements in A, otherwise "no". You can use an element only once.

You are given the sequence A and q questions where each question contains Mi.

Input

In the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers (Mi) are given.

Output

For each question Mi, print yes or no.

Constraints

n ≤ 20

q ≤ 200

1 ≤ elements in A ≤ 2000

1 ≤ Mi ≤ 2000

Sample Input 1

5
1 5 7 10 21
8
2 4 17 8 22 21 100 35

Sample Output 1

no
no
yes
yes
yes
yes
no
no

Notes

You can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:

solve(0, M)

solve(1, M-{sum created from elements before 1st element})

solve(2, M-{sum created from elements before 2nd element})

...

The recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.

For example, the following figure shows that 8 can be made by A[0] + A[2].

Solution in JavaScript (judge verdict: Wrong Answer)

(function(input) {
    var p = input.split('\n');
    var n = Number(p.shift());
    var A = p.shift().split(' ', n).map(Number);
    var q = Number(p.shift());
    var m = p.shift().split(' ', q).map(Number);

    for (var i = 0; i < m.length; i++) {
        //console.info("n = " + i);
        console.log(check(A, 0, m[i]) ? 'yes' : 'no');
        //console.info('##########');
    }

})(require('fs').readFileSync('/dev/stdin', 'utf8'));

function check(A, i, m) {
    //console.info("i = " + i);
    //console.info("m = " + i);
    var a = A[i];
    if (m < a) {
        return false;
    }
    if (m == a) {
        return true;
    }
    if (i == A.length - 1) {
        return false;
    }
    i++;
    return check(A, i, m - a) || check(A, i, m);
}