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.lang.*;
import java.util.*;
import java.util.stream.Collectors;
import java.io.*;

public class absolute {
	
	static 	List<Integer> list;
	public static boolean possible(int n)
	{

		for(int i=0;i<list.size();i++)
		{
			int st=0,end=list.size()-1;
			while(st<=end)
			{
			int mid = st + (end-st)/2;
			int sum = list.get(mid)+list.get(i);
			if(sum == n)return true;
			else if(sum > n)end=mid-1;
			else st=mid+1;
			}
		}
		return false;
	}
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		list = new ArrayList<Integer>();
		int i=1;
		while((long)(i*(i+1))/2 <= 1000000000) 
		{
			list.add(i*(i+1)/2);i++;
		}
		int n = sc.nextInt();
		System.out.println(possible(n)?"YES":"NO");
	}
	
}