Products sold in both stores

Problem

Two stores list the products they sell, and a product can be listed more than once. Find the products that both stores sell.

Input: The first line has n, then a line with n products of store A. Then a line with m, then a line with m products of store B.
Output: The first line is the number of common products. Then each common product on its own line, in alphabetical order.
Constraints: 1 ≤ n, m ≤ 10^5

Example

Input

4
laptop mouse cable mouse
3
cable keyboard laptop

Output

2
cable
laptop

cable and laptop are in both lists.

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

Hint 1

Copy store A into a TreeSet, then call retainAll with store B.

Hint 2

Print size(), then loop over the result.

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