## Elephant Codeforces solution in C++

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 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.

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

5

output

1

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

## Elephant Codeforces solution in C++

#include<iostream> using namespace std; int main() { int a,f=0; cin>>a; int d=0; if(a%5==0){ cout<<a/5<<endl; } else {cout<<(a/5)+1<<endl;//Elephant Codeforces } }

## Explain:

This tiny program asks for quite a number, a, and calculates the wide variety of companies of 5 that match inside it. It first determines whether or not a is lightly divisible through 5. If so, it outputs a/five, which is the wide variety of complete companies of five which you have. If a isn't precisely divisible by means of 5, then some remains after the range of entire companies of 5 is reached. In that instance, it writes (a/5) 1 to take into consideration the additional organization required for the leftovers. The final remark, // Elephant Codeforces`, increases the opportunity that there is a trouble with the Codeforces platform that is linked to this good judgment. As smooth as that!

Can you be more specific about the content of your article? After reading it, I still have some doubts. Hope you can help me.

Thanks for Your information. we are updating the content.