Steps to Destination

Develop a function calculating the minimum steps a character needs to reach a destination.

Your task is to implement a function that calculates the minimal number of moves required for a character to reach its destination from the origin on a 1-D plane. The character can advance 1, 2, 3, 4, or 5 steps in one move. The final destination is located at point `x` from the origin. ### Parameters - `x` (int): A positive integer representing the location of the destination on the line that is more than 0. (1 ≤ x ≤ 10^5) ### Return Value - The function should return an integer value representing the minimal number of steps required for the character to reach its final destination. ### Examples ```python # The character only needs to make one four-step move to reach the destination 4 units away solution(4) # returns: 1 # The character makes three 5-step moves to reach the destination 15 units away solution(15) # returns: 3 # The character makes two 5-step moves and one additional 3-step move to reach the destination 13 units away solution(13) # returns: 3 ```