Two backend systems, A and B, each maintain a list of customer IDs (integers; a system's own list may contain duplicates, which should be treated as a single membership). Find the customer IDs that belong to exactly one of the two systems (their symmetric difference).

Print these IDs sorted in ascending order, space-separated. If no such ID exists, print NONE.

Input format

Line 1: an integer n — size of system A's list. Line 2: n space-separated integers — system A's customer IDs. Line 3: an integer m — size of system B's list. Line 4: m space-separated integers — system B's customer IDs.

Output format

The sorted, space-separated IDs that appear in exactly one of the two systems, or NONE if there are none.

Constraints

• 1 ≤ n, m ≤ 1000
• -1000000000 ≤ each ID ≤ 1000000000

4
1 2 3 4
3
3 4 5

1 2 5

2
7 8
2
7 8

NONE