codeforces_679B. Bear and Tower of Cubes（贪心+二分+dfs）

B. Bear and Tower of Cubes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Limak is a little polar bear. He plays by building towers from blocks. Every block is a cube with positive integer length of side. Limak has infinitely many blocks of each side length.

A block with side a has volume a3. A tower consisting of blocks with sides a1, a2, ..., ak has the total volume a13 + a23 + ... + ak3.

Limak is going to build a tower. First, he asks you to tell him a positive integer X — the required total volume of the tower. Then, Limak adds new blocks greedily, one by one. Each time he adds the biggest block such that the total volume doesn't exceed X.

Limak asks you to choose X not greater than m. Also, he wants to maximize the number of blocks in the tower at the end (however, he still behaves greedily). Secondarily, he wants to maximize X.

Can you help Limak? Find the maximum number of blocks his tower can have and the maximum X ≤ m that results this number of blocks.

Input

The only line of the input contains one integer m (1 ≤ m ≤ 1015), meaning that Limak wants you to choose X between 1 and m, inclusive.

Output

Print two integers — the maximum number of blocks in the tower and the maximum required total volume X, resulting in the maximum number of blocks.

Examples

input

48

output

9 42

input

6

output

6 6

Note

In the first sample test, there will be 9 blocks if you choose X = 23 or X = 42. Limak wants to maximize X secondarily so you should choose 42.

In more detail, after choosing X = 42 the process of building a tower is:

• Limak takes a block with side 3 because it's the biggest block with volume not greater than 42. The remaining volume is42 - 27 = 15.
• The second added block has side 2, so the remaining volume is 15 - 8 = 7.
• Finally, Limak adds 7 blocks with side 1, one by one.

So, there are 9 blocks in the tower. The total volume is is 33 + 23 + 7·13 = 27 + 8 + 7 = 42.

当ans最优，那么当ans + sq*sq*sq >= (sq+1)(sq+1)(sq+1)时，ans + sq*sq*sq一定不是最优解，所以只要考虑最大边或最大边减一。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <stack>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#define Si(a) scanf("%d",&a)
#define Sl(a) scanf("%lld",&a)
#define Sd(a) scanf("%lf",&a)
#define Ss(a) scanf("%s",a)
#define Pi(a) printf("%d\n",(a))
#define Pl(a) printf("%lld\n",(a))
#define Pd(a) printf("%lf\n",(a))
#define Ps(a) printf("%s\n",(a))
#define W(a) while(a--)
#define mem(a,b) memset(a,(b),sizeof(a))
#define FOP freopen("data.txt","r",stdin)
#define inf 0x3f3f3f3f
#define maxn 1000010
#define mod 1000000007
#define PI acos(-1.0)
#define LL long long
using namespace std;

int solve(LL n)
{
    int mid,l=1,r=100002,ans;
    while(l<=r)
    {
        mid=l+r>>1;
        if(1LL*mid*mid*mid>n)
        {
            r=mid-1;
        }
        else
        {
            ans=mid;
            l=mid+1;
        }
    }
    return ans;
}

LL ans1=0,ans2=0;

void dfs(LL n,LL cot,LL sum)
{
    if(n<=7)
    {
        if(ans1<cot+n||(ans1==cot+n)&&(sum+n>ans2))
        {
            ans1=n+cot;ans2=sum+n;
        }
        return ;
    }
    int sq=solve(n);
    dfs(n-1LL*sq*sq*sq,cot+1,sum+1LL*sq*sq*sq);
    dfs(1LL*sq*sq*sq-1-1LL*(sq-1)*(sq-1)*(sq-1),cot+1,sum+1LL*(sq-1)*(sq-1)*(sq-1));
}

int main()
{
    LL n;
    scanf("%lld",&n);
    dfs(n,0,0);
    printf("%lld %lld\n",ans1,ans2);
    return 0;
}