eolymp
bolt
Try our new interface for solving problems
Problems

Olympiad in Hogwarts

Olympiad in Hogwarts

Time limit 1 second
Memory limit 128 MiB

In Hogwarts, the traditional annual Olympiad on the theory of magic among younger students is to be hold. School boss Argus Filch was commissioned to distribute students to the audience.

Each department proposed its best students to the Olympiad. From gryffindor g students are involved, from slytherin s students, puffendui represents h students and Kogtevran r students. Filch has at his disposal m rooms. The rooms has a special spell of expansion, so if necessary, they can accommodate any number of students. When seating it is necessary to take into account that students of the same department who are in the same classroom can, taking advantage of the opportunity, begin to cheat, exchanging ideas on how to solve problems. Therefore, in any room the number of students from one department who fall into it should be minimized. Let's call such placement optimal.

Find the minimum number of students from one department that have to sit in the same classroom, even with optimal seating.

Input data

The first line contains four integers g, s, h and r (1g, s, h, r1000) - number of students representing each of the school's department.

Second line contains integer m (1m1000) - the number of classes that Filch has.

Output data

Print the minimum number of students from one department that Filch will have to put in one classroom, even with optimal seating.

Examples

Input example #1
4 3 4 4
2
Output example #1
2
Input example #2
15 14 13 14
5
Output example #2
3
Source 2013 Moscow city informatics olympiad for 6-9 classes, Moscow, February 3, Problem А