Hide

Problem C
Golf Bot

\includegraphics[width=0.45\textwidth ]{golf.jpg} \includegraphics[width=0.3\textwidth ]{knob.png}

Do you like golf? I hate it. I hate golf so much that I decided to build the ultimate golf robot, a robot that will never miss a shot. I simply place it over the ball, choose the right direction and distance and, flawlessly, it will strike the ball across the air and into the hole. Golf will never be played again.

Unfortunately, it doesn’t work as planned. So, here I am, standing in the green and preparing my first strike when I realize that the distance-selector knob built-in doesn’t have all the distance options! Not everything is lost, as I have 2 shots.

Task

Given my current robot, how many holes will I be able to complete in 2 strokes or less?

Input

The first line has one integer: $N$, the number of different distances the Golf Bot can shoot. Each of the following $N$ lines has one integer, $k_ i$, the distance marked in position $i$ of the knob.

Next line has one integer: $M$, the number of holes in this course. Each of the following $M$ lines has one integer, $d_ j$, the distance from Golf Bot to hole $j$.

Constraints

$1 \leq N, M \leq 200\, 000$
$1 \leq k_ i, d_ j \leq 200\, 000$

Output

You should output a single integer, the number of holes Golf Bot will be able to complete. Golf Bot cannot shoot over a hole on purpose and then shoot backwards.

Sample Output Explanation

Golf Bot can shoot 3 different distances (1, 3 and 5) and there are 6 holes in this course at distances 2, 4, 5, 7, 8 and 9. Golf Bot will be able to put the ball in 4 of these:

  • The 1$^{st}$ hole, at distance 2, can be reached by striking two times a distance of 1.

  • The 2$^{nd}$ hole, at distance 4, can be reached by striking with strength 3 and then strength 1 (or vice-versa).

  • The 3$^{rd}$ hole can be reached with just one stroke of strength 5.

  • The 5$^{th}$ hole can be reached with two strikes of strengths 3 and 5.

Holes 4 and 6 can never be reached.

Sample Input 1 Sample Output 1
3
1
3
5
6
2
4
5
7
8
9
4

Please log in to submit a solution to this problem

Log in