Look up student names by their unique IDs.

Input

The first line contains n. Each of the next n lines contains an ID followed by a nonempty name, which may contain spaces. The next line contains q, followed by q ID lines.

$1 \le n,q \le 10^5$. IDs contain no spaces; names are nonempty and extend to the end of their record line. IDs are unique.

Output

For each queried ID, print its name if it exists; otherwise print NOT FOUND.

Example

Input

3
SV001 Hoang Van Nam
SV002 Ngo Gia Long
SV005 Phuong The Ngoc
3
SV002
SV004
SV005

Output

Ngo Gia Long
NOT FOUND
Phuong The Ngoc