#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

Enough Pages - Repovive Starter Round 3 | Repovive

12A. Enough Pages

500 pts1s256 MB

You have a book with $n$ pages.

Each day, you read exactly $7$ pages, except possibly on the last day, when fewer than $7$ pages may remain.

Find the minimum number of days needed to finish the book.

Constraints

$1 \le n \le 10^9$

Input

The input contains a single integer $n$ .

n

Output

\text{answer}

Samples

Input

Explanation

The book has only one page, so it can be finished on the first day.

Output

Input

Explanation

After two days, $14$ pages have been read. The remaining $6$ pages can be finished on the third day.

Output

You have a book with $n$ pages.

Each day, you read exactly $7$ pages, except possibly on the last day, when fewer than $7$ pages may remain.

Find the minimum number of days needed to finish the book.

$1 \le n \le 10^9$

The input contains a single integer $n$ .

n

\text{answer}

After two days, $14$ pages have been read. The remaining $6$ pages can be finished on the third day.

	#	Title	Points	Solved	Admin

	#	Title	Points	Solved	Admin

	#	Title	Points	Solved	Admin

	#	Title	Points	Solved	Admin

Commentary

My submissions

Sponsors

Ranking

Commentary

My submissions

Sponsors

Ranking

Commentary

My submissions

Sponsors

Ranking

Commentary

My submissions

Sponsors

Ranking

12A. Enough Pages

Constraints

Input

Output

Samples

12A. Enough Pages

Constraints

Input

Output

Samples