Fleet Fuel Rebalancing Swap

Two logistics depots, North and South, each store a collection of sealed fuel canisters holding a known integer number of liters. The depot managers have agreed to swap exactly one canister from North for exactly one canister from South so that, after the exchange, the two depots hold exactly the same total amount of fuel. It is guaranteed that at least one such pair of canisters exists among the depots' current stock (the two totals may already be equal, in which case swapping two equal-valued canisters also counts as valid). Given the liter readings of every canister in both depots, report the liters of one canister from North and the liters of one canister from South that can be swapped to leave both depots with equal totals.

Input format

• Line 1: an integer n, the number of canisters at North.
• Line 2: n space-separated integers, the liters held by each canister at North, in depot order.
• Line 3: an integer m, the number of canisters at South.
• Line 4: m space-separated integers, the liters held by each canister at South, in depot order.

Output format

Print two space-separated integers: the liters of the chosen North canister followed by the liters of the chosen South canister. Any pair that equalizes the two totals after the swap is an acceptable answer.

Constraints

• 1 <= n, m <= 10000
• 1 <= liters of any single canister <= 100000
• It is guaranteed that at least one valid swap pair exists.

3
1 2 5
2
2 4

5 4

3
6 1 9
2
2 4

9 4