Interesting drink

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem Statement

There are $n$ shops. A bottle costs $x_i$ coins in shop $i$.

For each of $q$ days, you have at most $m_j$ coins. Determine how many shops sell a bottle for a price not greater than $m_j$.

Input

The first line contains $n$.

The second line contains $x_1,x_2,\ldots,x_n$.

The third line contains $q$.

Each of the next $q$ lines contains one value $m_j$.

Output

For each day, print the number of shops with $x_i\le m_j$.

Subtasks

• Subtask 1 — 20%: $1\le n,q\le100$.
• Subtask 2 — 30%: $1\le n,q\le5000$.
• Subtask 3 — 50%: $1\le n,q\le10^5$, $1\le x_i\le10^5$, $1\le m_j\le10^9$.

Examples

Input

5
3 10 8 6 11
4
1
10
3
11

Output

0
4
1
5

Explanation

For $m=10$, exactly four shop prices are at most $10$: $3,6,8,10$.