## Algorithm

A. Elephant
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 > 0) of the coordinate line. In one step the elephant can move 1234 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.

Input

The first line of the input contains an integer x (1 ≤ x ≤ 1 000 000) — The coordinate of the friend's house.

Output

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

Examples
input
Copy
`5`
output
Copy
`1`
input
Copy
`12`
output
Copy
`3`
Note

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 35 and 4. There are other ways to get the optimal answer but the elephant cannot reach x in less than three moves.

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include<iostream>
using namespace std;

int main(){
int n;
cin>>n;

int steps = n % 5 == 0 ? n / 5 :(n / 5) + 1;
cout<<steps;
return 0;
}``````
Copy The Code &

Input

cmd
5

Output

cmd
1