C. Cosmic candidates
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

With the approaching Interplanetary Programming Marathon, Enrique, the Coach of the Union of Solar Planets Marathon Group (MaratonUSP), is determined to bring all $$$n$$$ members of the group to participate in this historic competition, which will be held on Earth for the first time.

Members of MaratonUSP are organized into teams of $$$3$$$ members. Enrique is confident that the members will be excited about the opportunity to compete with talents from across the universe. He understands that, to ensure the participation of each team, he only needs to convince the majority of the 3 members, as the last member will immediately agree to participate.

With a tight schedule, the Coach seeks your assistance in determining the minimum number of people he needs to convince to participate in the Interplanetary Programming Marathon, ensuring that all MaratonUSP teams agree to compete in this space event.

Input

The input consists of a single line containing an integer $$$n$$$, $$$n \le 100$$$.

It is guaranteed that $$$n$$$ is a multiple of $$$3$$$.

Output

Print a single number: the minimum number of MaratonUSP members that the coach must convince to participate in the Interplanetary Programming Marathon to ensure the participation of all teams in the competition.

Examples
Input
3
Output
2
Input
6
Output
4