13周练J - Little Artem and Presents【规律】

J - Little Artem and Presents

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Little Artem got n stones on his birthday and now wants to give some of them to Masha. He knows that Masha cares more about the fact of receiving the present, rather than the value of that present, so he wants to give her stones as many times as possible. However, Masha remembers the last present she received, so Artem can't give her the same number of stones twice in a row. For example, he can give her3 stones, then 1 stone, then again 3 stones, but he can't give her 3 stones and then again 3 stones right after that.

How many times can Artem give presents to Masha?

Input

The only line of the input contains a single integer n (1 ≤ n ≤ 10⁹) — number of stones Artem received on his birthday.

Output

Print the maximum possible number of times Artem can give presents to Masha.

Sample Input

Input

1

Output

1

Input

2

Output

1

Input

3

Output

2

Input

4

Output

3

题解：1 2 1 2 1 2 .......一直排，其次处理最后剩2的情况就好

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n==1||n==2)
        {
            printf("1\n");
            continue;
        }
        else
        {
            int m=n/3;
            int k=n%3;
            if(!k)
                printf("%d\n",m*2);
            else
                printf("%d\n",m*2+1);
        }
    }
    return 0;
}