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

	public class FastIO{
			
		BufferedReader br;
		StringTokenizer st;
		
		public FastIO(){ // constructor
			
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		
		String next(){
			
			while (st == null || !st.hasMoreElements()){
				try{
					st = new StringTokenizer(br.readLine());
				}
				
				catch (IOException e){
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		int nextInt(){
			
			return Integer.parseInt(next());
		}
		
		long nextLong(){
			
			return Long.parseLong(next());
		}
		
		double nextDouble(){
			return Double.parseDouble(next());
		}

		String nextLine(){
			
			String str = "";
			try{
				
				str = br.readLine();
			}
			catch (IOException e){
				
				e.printStackTrace();
			}
			return str;
		}
		
		// int dir[][] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
		
		// T.C. -> O(log N) N = min(a, b) 
		static int gcd(int a, int b) {
			
			if(b == 0) {
				return a;
			}
			
			return gcd(b, a % b);
		}
		
		static void sort(int[] arr){
	        int n = arr.length;
	        Random rnd = new Random();
	        for(int i=0; i<n; ++i){
	            int tmp = arr[i];
	            int randomPos = i + rnd.nextInt(n-i);
	            arr[i] = arr[randomPos];
	            arr[randomPos] = tmp;
	        }
	        Arrays.sort(arr);
	   }
		
	public static void main(String[] args) throws IOException {
		
		FastIO in = new FastIO();
		PrintWriter out = new PrintWriter(System.out);
		
		// int n = io.nextInt(); -> for int
		// double d = io.nextDouble(); -> for double
		// String ch = io.next(); -> for one word
		// String str = io.nextLine(); -> for the entire line
		
		int n = in.nextInt();
		
		Set<Long> set = new HashSet<>();
	
		for(long i = 1; i <= (int)1e5; i++) {
			long num = (i * (i + 1)) / 2;
			
			if(num <= n) {
				set.add(num);
			}
			else {
				break;
			}
		}
		
		for(long x : set) {
			if(x <= n && set.contains(n - x)) {
				System.out.println("YES");
				return;
			}
		}
		
		out.println("NO");
		
		out.flush();
		out.close();
	}
}