Two relay towers each keep a log of the beacon transmissions they've picked up. Every entry in a log lists a frequency channel and the power level broadcast on it, and within a single tower's own log no frequency channel is ever logged twice. The network operations team wants to consolidate both towers' logs into one master log: whenever a frequency channel shows up in both logs, the consolidated entry for that channel should carry the sum of the two towers' power levels for it; a channel that appears in only one log keeps that log's power level unchanged. Produce the consolidated log sorted by frequency channel in increasing order.

Input format

The first line contains an integer n1, the number of entries in the first tower's log. Each of the next n1 lines contains two integers freq and power describing one logged transmission. The next line contains an integer n2, the number of entries in the second tower's log, followed by n2 lines in the same two-integer format.

Output format

Print an integer k, the number of distinct frequency channels appearing across both logs. Then print k lines, each containing two integers: the frequency channel and its consolidated power level, ordered by frequency channel in strictly increasing order.

Constraints

• 0 <= n1, n2 <= 1000
• 1 <= freq <= 1000
• 1 <= power <= 1000
• Within a single tower's log, all freq values are distinct.

3
1 1
4 5
3 8
2
3 1
1 5

3
1 6
3 9
4 5

3
1 1
3 2
2 3
3
2 1
3 2
1 3

3
1 4
2 4
3 4