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:
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
	    try{
	        Scanner sc=new Scanner(System.in);
	        int n=sc.nextInt();
	        HashSet<Integer> set =new HashSet<>();
	        ArrayList<Integer> al=new ArrayList<>();
	        
	        for(int i=0;i*((i+1))/2<n;i++){
	            set.add(i*((i+1))/2);
	            al.add(i*((i+1))/2);
	            
	        }
	        boolean found=false;
	        for(int i=0;i<al.size();i++){
	            if(set.contains(n-al.get(i))){
	              found=true;
	              break;
	            }
	        }
	        if(found){
	            System.out.println("YES");
	        }else{
	            System.out.println("NO");
	        }
	        
	    }catch(Exception e){}
		// your code goes here
	}
}