eolymp
bolt
Try our new interface for solving problems
Problems

Divisibility by 3

Divisibility by 3

Time limit 1 second
Memory limit 128 MiB

Let's consider a sequence 1, 12, 123, 1234, 12345, 123456, 1234567, 12345678, 123456789, 12345678910, 1234567891011, ... .

Write a program that determines how many elements of this sequence among first n are divisible by three.

Input data

One positive integer n~(1 \le n \le 2^{31} - 1).

Output data

Print one number — the answer to the problem.

Examples

Input example #1
4
Output example #1
2
Source 2014 ACM-ICPC Ukraine, 2nd Round Ukraine, September 13, Problem F