It's Corona Time and David decided to gift first aid box of masks. In order to maintain social distancing and avoiding all sort of conflicts between people, David wants all first aid box to be identical.
He has N various kinds of masks, a[i] in number. David wants you to create boxes that will contain K pieces of masks each. Compute and return the maximum number of identical bags you can make. 

NOTE: it's not compulsory to take all kind of masks

INPUT: The first line of the input contains an integer N denoting the number type of masks, the next line of the input contains n spaced integers denoting the number masks of each type they have. The third line contains the integer K. 

OUTPUT: Print a single line, the value of the integer asked.

CONSTRAINTS: 

1<N<10⁵

1<a_i<10¹⁸

1<K<10¹⁸.

where a_i denotes the ith element of the array.