St Andrews Online Judge

Power Quintet

By Kay Akashi

Time: 1000 ms
Memory: 256000 kB

The code judging system is only available during contests. Check out the github repo for test cases and solutions.

Please log in.

Problem Statement

Given an integer NN, judge if there's any combination of 55 non-negative integers (a,b,c,d,e)(a, b, c, d, e) such that aa+bb+cc+dd+ee=Na^{a} + b^{b} + c^{c} + d^{d} + e^{e} = N.

Constraints

0N1050 \leq N \leq 10^{5}.

Input

The input consists of a single integer, NN.

Output

If there's any combination that satisfies the outlined condition, output "Yes". Otherwise, "No" (case-specific).

Examples

Input

3410

Output

Yes

Explanation

(a,b,c,d,e)=(3,1,4,1,5)(a, b, c, d, e) = (3, 1, 4, 1, 5) satisfies the condition.

Input

0

Output

No

Explanation

Be noted that if (a,b,c,d,e)=(0,0,0,0,0)(a, b, c, d, e) = (0, 0, 0, 0, 0) the resulting value is 55.