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.BufferedReader;
import java.io.InputStreamReader;

public class con121_A {

	public static void main( final String[] args ) throws Exception {
		final BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );
		final int n = Integer.parseInt( br.readLine() );
		System.out.println( solve( n ) );
	}

	private static String solve( final long n ) {
		final String res = "NO";
		for ( long k = 1; k * ( k + 1 ) / 2 < n; ++k ) {
			if ( isFunky( n - ( k * ( k + 1 ) / 2 ) ) ) return "YES";
		}
		return res;
	}

	private static boolean isFunky( final long l ) {
		final long s = (long) Math.sqrt( 2 * l );
		return s * ( s + 1 ) / 2 == l;
	}

}