# 74. Mn, Mn + 1, ... Mn + M - 1

## I'm a slow walker, but I never walk backwards.

Write a program to count the number of integers which can be written as $M\cdot k, M\cdot k + 1,$ ... and $M\cdot k + M - 1$ respectively.

## Input format

The first line has the number of input integers $N$. Each of the following $N$ lines has an input integer. The last line has $M$.

• $1\le M \le 200000$

## Output format

the number of integers which can be written as $M\cdot k, M\cdot k + 1,$ ... and $M\cdot k + M - 1$.

## Sample input 1

5123453


## Sample output 1

122


## Sample input 2

1031415926533


## Sample output 2

433