【MUH and House of Cards】【CodeForces - 471C】(数学+思维）

题目：

Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev decided to build a house of cards. For that they've already found a hefty deck of n playing cards. Let's describe the house they want to make:

1. The house consists of some non-zero number of floors.
2. Each floor consists of a non-zero number of rooms and the ceiling. A room is two cards that are leaned towards each other. The rooms are made in a row, each two adjoining rooms share a ceiling made by another card.
3. Each floor besides for the lowest one should contain less rooms than the floor below.

Please note that the house may end by the floor with more than one room, and in this case they also must be covered by the ceiling. Also, the number of rooms on the adjoining floors doesn't have to differ by one, the difference may be more.

While bears are practicing to put cards, Horace tries to figure out how many floors their house should consist of. The height of the house is the number of floors in it. It is possible that you can make a lot of different houses of different heights out of n cards. It seems that the elephant cannot solve this problem and he asks you to count the number of the distinct heights of the houses that they can make using exactly n cards.

Input

The single line contains integer n (1 ≤ n ≤ 1012) — the number of cards.

Output

Print the number of distinct heights that the houses made of exactly n cards can have.

Examples

Input

13

Output

1

Input

6

Output

0

Note

In the first sample you can build only these two houses (remember, you must use all the cards):

Thus, 13 cards are enough only for two floor houses, so the answer is 1.

The six cards in the second sample are not enough to build any house.

 

解题报告：给定咱们卡牌房屋的构建规则，然后给定卡牌数目，问这些卡牌可以构成的不同层数的房屋的数目。咱们要先考虑一下，构成高度为k的房屋最少需要多少卡牌，然后咱们将这个多余的卡牌进行处理，来找到不同层数的房屋的数目。最少的构建情况，2，5 8……,会发现每层的卡牌的数目是3*n-1，这里的n是第n层，累积起来前n层，就会有n*(3*n+1)/2个卡牌，如果剩下的是3的倍数的话，咱们就可以将这些放到这层，而不去考虑下层，这样就可以实现不同层数了，因为咱们的第一层是只有两个的。

ac代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
typedef long long ll;

ll cal(ll x)
{
	return x*(3*x+1)/2;
}

int main()
{
	ll n;
	while(scanf("%lld",&n)!=EOF)
	{
		ll ans=0;
		for(ll i=1;cal(i)<=n;i++)
		{
			if((n-cal(i))%3==0)
				ans++;
		}
		printf("%lld\n",ans);
	}
	return 0;
}