Customer overlap report

Problem

Two lists hold the names of customers who ordered in January and in February. A customer can appear more than once in a list. Build a report that compares the two months.

Input, output and limits

Input: The first line has n, then a line with n January names. Then a line with m, then a line with m February names.
Output: Four lines: Both: ..., Only January: ..., Only February: ... and Total: k. Each list is in alphabetical order, separated by single spaces; an empty list is written as -. k is the number of different customers in the two months together.
Constraints: 1 ≤ n, m ≤ 10^5

Examples

Example

Input

4
Rohan Priya Rohan Aarav
3
Priya Diya Diya

Output

Both: Priya
Only January: Aarav Rohan
Only February: Diya
Total: 4

Priya is in both months; Total counts Aarav, Diya, Priya and Rohan.

Hints

Try the problem first. Open one hint at a time.

Hint 1

Build two TreeSets, one per month.

Hint 2

Both = intersection, Only January = difference, Total = size of the union; always work on copies.

Write your Java code, run it on the examples and submit it to hidden tests.

Solve in the editor

All Java problems

Problem

Input, output and limits

Examples

Hints

More Sets problems

Problem

Input, output and limits

Examples

Hints

More Sets problems