When is the catalogue fully ordered?

Problem

A shop has a catalogue of products. Orders then arrive one product at a time, and some products in the orders are not in the catalogue. Find the position of the order at which every catalogue product has been ordered at least once.

Input, output and limits

Input: The first line has m, then one line with m catalogue products. Then a line with n, then one line with n ordered products, in the order they arrived.
Output: The 1-based position of the order that completes the catalogue, or NOT YET if some catalogue product is never ordered.
Constraints: 1 ≤ m, n ≤ 10^5
Catalogue products are distinct.

Examples

Example

Input

3
laptop mouse cable
6
mouse tablet laptop mouse cable laptop

Output

cable, the last missing product, arrives at position 5. tablet is not in the catalogue and is ignored.

Hints

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

Hint 1

Put the catalogue products in a HashSet of products still waiting to be ordered.

Hint 2

remove returns true only when the product was in the set. When the set becomes empty, the current position is the answer.

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