Elephant

题意翻译

## 题意简述 数轴起点坐标为0,终点坐标为x,可以向前移动1/2/3/4/5个单位长度,问最少几步可以从起点到终点。 ## 题目描述 一只大象决定去拜访他的朋友。结果,大象的房子位于0点0,他的朋友的房子位于点X。每一步大象可以向前移动1、2、3、4或5个位置。问:他最少走多少步才能到达他的朋友的房子。 ## 输入输出格式 ### 输入格式: 输入共一行,只有一个整数x($ 1<=x<=1000000 $)表示朋友家的坐标。 ### 输出格式: 输出共一行,只有一个整数,表示大象到达他的朋友的房子的最少步数。 ## 样例说明 在第一个样例中,大象需要走一步长度为5,以到达X点。 在第二个样例中,如果大象移动3,5和4步,可以到达X点。还有其他方法三步到达,但大象不能以少于三步的方法到达X点。 感谢@仁和_童博扬 提供的翻译

题目描述

An elephant decided to visit his friend. It turned out that the elephant's house is located at point $ 0 $ and his friend's house is located at point $ x(x&gt;0) $ of the coordinate line. In one step the elephant can move $ 1 $ , $ 2 $ , $ 3 $ , $ 4 $ or $ 5 $ positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.

输入输出格式

输入格式


The first line of the input contains an integer $ x $ ( $ 1<=x<=1000000 $ ) — The coordinate of the friend's house.

输出格式


Print the minimum number of steps that elephant needs to make to get from point $ 0 $ to point $ x $ .

输入输出样例

输入样例 #1

5

输出样例 #1

1

输入样例 #2

12

输出样例 #2

3

说明

In the first sample the elephant needs to make one step of length $ 5 $ to reach the point $ x $ . In the second sample the elephant can get to point $ x $ if he moves by $ 3 $ , $ 5 $ and $ 4 $ . There are other ways to get the optimal answer but the elephant cannot reach $ x $ in less than three moves.