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 threadpractice;
//import java.text.DecimalFormat;
//import java.util.*;
import java.io.*;
//import java.util.*;

//import java.math.BigInteger;

public class Main {
    
  
    public static void main(String args[]) {
        try {
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        //
        
        long n = Long.parseLong(br.readLine());
        n = 2*n;
        long start = 1;
        long end = (long)Math.sqrt(n-2);
        boolean found = false;
        while(start<=end){
            long sum = (start*(start+1))+(end*(end+1)) ;
            if(sum==n){
                System.out.println("YES");
                found = true;break;
            }
            else if(sum>n){
                end--;
            }
            else{
                start++;
            }
        }
        if(!found){
            System.out.println("NO");
        }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
   }