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 Mssolved;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class funky {
static int trig[];
	static void count(){
		int st=1; 
		int count=0; int base=2;
		trig=new int[44721];
		while(st<=(int)1e9){
			trig[count++]=st;
			st+=base;
			base++;
			
		}
		
		
	}
	public static void main(String[] args) throws IOException{
	BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
	int n=Integer.parseInt(in.readLine());
	count();
	for (int i = 0; i < trig.length; i++) {
		if(trig[i]>n)
			break;
		int diff=n-trig[i];
		
		int idx=Arrays.binarySearch(trig, diff);
		if(idx>=0&&idx<=trig.length&&trig[idx]==diff){
			System.out.println("YES");
			return;
		}
		}
	System.out.println("NO");
	}
}