Problem Statement

There are N toys and M toy boxes.
Each toy and each toy box has a fixed volume.
A toy whose volume is at most the volume of a toy box can be put into that toy box.
A toy box can hold any number of toys as long as the total does not exceed the volume of the toy box.
A toy box must not be put into another toy box.

For example, suppose there are a toy of volume 2, a toy of volume 3, and a toy box of volume 5.
In this case, the total volume of the two toys is 5, so they fit into the toy box of volume 5.

For example, suppose there are a toy of volume 8, a toy of volume 12, and a toy box of volume 10.
In this case, the total volume of the two toys is 20, so they do not fit into the toy box of volume 10.
However, the toy of volume 8 alone fits into the toy box of volume 10.

You are given the information about the toys and the toy boxes.
Find the minimum number of toy boxes with which all the toys can be put away.
However, if not all of the toys can fit into the toy boxes, the answer is -1.

Input

\(N\)
\(A_0\,A_1\, \dots\,A_{n-1}\)
\(M\)
\(B_0\,B_1\, \dots\,B_{m-1}\)

\(N\) is a positive integer. \(1 \le N \le 10 \).
The next line gives the volumes of the N toys on a single line.
\(A_i \) is a positive integer. \(1\le A_i \le 20\).
\(M \) is a positive integer. \(1\le M \le 10\).
The next line gives the volumes of the \(M \) toy boxes on a single line.
\(B_i \) is a positive integer. \(1\le B_i \le 20\).

Output

Find the minimum number of toy boxes.
If it is impossible, return -1.
Do not forget the newline.

Sample

2
2 3
1
5

1

2
8 12
2
10 10

-1

10
1 1 1 1 1 1 1 1 1 1
10
9 9 9 9 9 9 9 9 9 9

2

9
2 1 3 11 5 17 13 19 7
6
20 14 18 12 16 10

5