CF232D Fence

John Doe has a crooked fence, consisting of $ n $ rectangular planks, lined up from the left to the right: the plank that goes $ i $ -th $ (1

The first line contains integer $ n $ ( $ 1

For each query on a single line print a single integer — the number of pieces of the fence that match the given one. Print the answers to the queries in the order, in which the queries are given in the input.