Problem: As you very well know, this year's funkiest numbers are so called triangular numbers (that is, integers that are representable as <image>, where k is some positive integer), and the coolest numbers are those that are representable as a sum of two triangular numbers.

A well-known hipster Andrew adores everything funky and cool but unfortunately, he isn't good at maths. Given number n, help him define whether this number can be represented by a sum of two triangular numbers (not necessarily different)!

Input

The first input line contains an integer n (1 ≤ n ≤ 109).

Output

Print "YES" (without the quotes), if n can be represented as a sum of two triangular numbers, otherwise print "NO" (without the quotes).

Examples

Input

256


Output

YES


Input

512


Output

NO

Note

In the first sample number <image>.

In the second sample number 512 can not be represented as a sum of two triangular numbers.

Solution (in JAVA):

Solution:
import java.util.*;
public class Main 
{
    public static void main(String[] args) 
    {   
        TaskA solver = new TaskA();
        TaskA.solve();  
    }
}
class TaskA 
{    
    public static void solve()
    {       
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        boolean bool = false;
        int a, b, c;
        for(int i = 1; i*i+i < 2*n; ++i)
        {
            a = i;
            c = 2*n - a*a - a;
            b = (int)Math.sqrt((double)c);
            if(b*b + b == c)
            {
                bool = true;
                System.out.println("YES");
                break;
            }
        }
        if(!bool)
            System.out.println("NO");
    }        
}