Virat decided to visit Anushka's house. Virat's house is located at point 0 and Anushka's house is located at point x(x > 0) on the coordinate line.
In one step Virat can move 1, 2, 3, 4 or 5 positions forward.
Determine, what is the minimum number of steps he needs to make in order to reach Anushka's house.
Input:
The first line of the input contains an integer t(1≤t≤100), the number of test-cases
The first line of the test case contains a single integer x (1 ≤ x ≤ 1000000) — The coordinate of the Anushka's house.
Output:
Print the minimum number of steps that Virat needs to make to get from point 0 to point x.
In the first test case the Virat needs to make one step of length 5 to reach the point x.
In the second test case the Virat can get to point x if he moves by 3, 5 and 4. There are other ways to get the optimal answer but the Virat cannot reach x in less than three moves.
