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.io.*;

import java.util.*;
import java.math.*;
import java.util.AbstractMap.SimpleEntry;
import java.util.stream.IntStream;






public class Main{
    public static void main(String[] args) throws IOException {
   
        BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.parseInt(bf.readLine());
        ArrayList<Integer> al=new ArrayList();
        HashMap<Integer,Integer> hm=new HashMap();
        int x=1;
        while(true){
            int num=(int)((long)x*((long)x+1))/2;
            
            if(num>=n){break;}
          
            al.add(num);
            hm.put(num, 0);
        x++;}
        
        boolean key=false;
        for(int i=0;i<al.size();i++){
           
        int temp=n-al.get(i);
       if(hm.containsKey(temp)){key=true;}
       
        }
        if(key){System.out.println("YES");}else{System.out.println("NO");}
    }
    
}