Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Divisor Subtraction

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given an integer number $$$n$$$. The following algorithm is applied to it:

- if $$$n = 0$$$, then end algorithm;
- find the smallest prime divisor $$$d$$$ of $$$n$$$;
- subtract $$$d$$$ from $$$n$$$ and go to step $$$1$$$.

Determine the number of subtrations the algorithm will make.

Input

The only line contains a single integer $$$n$$$ ($$$2 \le n \le 10^{10}$$$).

Output

Print a single integer — the number of subtractions the algorithm will make.

Examples

Input

5

Output

1

Input

4

Output

2

Note

In the first example $$$5$$$ is the smallest prime divisor, thus it gets subtracted right away to make a $$$0$$$.

In the second example $$$2$$$ is the smallest prime divisor at both steps.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/13/2021 00:38:04 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|