Integer Points

题意翻译

有一个长度为n的序列p1，p2...pn，代表n条直线 y=x+pi 有一个长度为m的序列q1，q2...qm，代表m条直线 y=-x+qi 问这n+m条直线之间有多少个整数交点。

题目描述

DLS and JLS are bored with a Math lesson. In order to entertain themselves, DLS took a sheet of paper and drew $ n $ distinct lines, given by equations $ y = x + p_i $ for some distinct $ p_1, p_2, \ldots, p_n $ . Then JLS drew on the same paper sheet $ m $ distinct lines given by equations $ y = -x + q_i $ for some distinct $ q_1, q_2, \ldots, q_m $ . DLS and JLS are interested in counting how many line pairs have integer intersection points, i.e. points with both coordinates that are integers. Unfortunately, the lesson will end up soon, so DLS and JLS are asking for your help.

输入输出格式

输入格式

The first line contains one integer $ t $ ( $ 1 \le t \le 1000 $ ), the number of test cases in the input. Then follow the test case descriptions. The first line of a test case contains an integer $ n $ ( $ 1 \le n \le 10^5 $ ), the number of lines drawn by DLS. The second line of a test case contains $ n $ distinct integers $ p_i $ ( $ 0 \le p_i \le 10^9 $ ) describing the lines drawn by DLS. The integer $ p_i $ describes a line given by the equation $ y = x + p_i $ . The third line of a test case contains an integer $ m $ ( $ 1 \le m \le 10^5 $ ), the number of lines drawn by JLS. The fourth line of a test case contains $ m $ distinct integers $ q_i $ ( $ 0 \le q_i \le 10^9 $ ) describing the lines drawn by JLS. The integer $ q_i $ describes a line given by the equation $ y = -x + q_i $ . The sum of the values of $ n $ over all test cases in the input does not exceed $ 10^5 $ . Similarly, the sum of the values of $ m $ over all test cases in the input does not exceed $ 10^5 $ . In hacks it is allowed to use only one test case in the input, so $ t=1 $ should be satisfied.

输出格式

For each test case in the input print a single integer — the number of line pairs with integer intersection points.

输入输出样例

输入样例 #1

3
3
1 3 2
2
0 3
1
1
1
1
1
2
1
1

输出样例 #1

3
1
0

说明

The picture shows the lines from the first test case of the example. Black circles denote intersection points with integer coordinates. 

题意翻译

有一个长度为n的序列p1，p2...pn，代表n条直线 y=x+pi 有一个长度为m的序列q1，q2...qm，代表m条直线 y=-x+qi 问这n+m条直线之间有多少个整数交点。