Answer frequency queries for an integer array.

Input

The first line contains n, followed by n integers. The next line contains q, followed by q queried integers.

Array and query counts are between $1$ and $10^5$. Integer values are between $-10^9$ and $10^9$. Deleting a missing multiset value has no effect.

Output

For each queried x, print x - f if x occurs f times; otherwise print x - NOT FOUND!.

Example

Input

4
1 2 2 3
2
2
4

Output

2 - 2
4 - NOT FOUND!