Ladder Jumps - Repovive Starter Round 3 | Repovive

12B. Ladder Jumps

1000 pts1s256 MB

You are standing on a ladder. Initially, you are at height $0$ , and you want to reach height $d$ .

In one jump, you must do exactly one of the following:

go up by $1$ unit;
go down by $1$ unit;
go up by $3$ units;
go down by $3$ units.

Find the minimum number of jumps needed to reach height $d$ from height $0$ .

It is allowed to go above height $d$ or below height $0$ during the process. Only the final height must be exactly $d$ .

Constraints

$0 \le d \le 10^6$

Input

The input contains one integer:

d

Output

Output one integer, the minimum number of jumps needed.

ans

Samples

Input

Explanation

You are already at height $0$ , so no jump is needed.

Output

Input

Explanation

Two jumps of $+1$ reach height $2$ . A single jump can only change the height by $+1$ , $−1$ , $+3$ , or $−3$ , so it cannot end at height $2$ .

Output

Input

Explanation

One valid sequence is $+3,+3,+1,+1$ , ending at height $8$ .

Output

You are standing on a ladder. Initially, you are at height $0$ , and you want to reach height $d$ .

In one jump, you must do exactly one of the following:

go up by $1$ unit;
go down by $1$ unit;
go up by $3$ units;
go down by $3$ units.

Find the minimum number of jumps needed to reach height $d$ from height $0$ .

It is allowed to go above height $d$ or below height $0$ during the process. Only the final height must be exactly $d$ .

$0 \le d \le 10^6$

The input contains one integer:

d

Output one integer, the minimum number of jumps needed.

ans

You are already at height $0$ , so no jump is needed.

Two jumps of $+1$ reach height $2$ . A single jump can only change the height by $+1$ , $−1$ , $+3$ , or $−3$ , so it cannot end at height $2$ .

One valid sequence is $+3,+3,+1,+1$ , ending at height $8$ .

My submissions

Announcements

My submissions

Announcements

My submissions

Announcements

My submissions

Announcements

12B. Ladder Jumps

Constraints

Input

Output

Samples

12B. Ladder Jumps

Constraints

Input

Output

Samples