JO NUMBER likes a number that can be represented as nx (n + 1) (n + 2) = 3 where n is a positive integer. He named those number as JoNumber. Given an integer Xcould X be represented as a sum of 2 JoNumber? Format Input The first line is an integer T representing the number of test cases. For each test case, there will be 1 line consisting of an integer X. Format Output For each test case output "Case #1: S". I is the test case number and Sis the answer to the question. If X could be represented as a sum of 2 JoNumber then output "Yes", otherwise output No. Constraints 1ST 55 1sX s 1015 Sample Input 1 (standard input) 2 10 11 Sample Output 1 (standard output) Case #1: Yes Case #2: No NOTES: USING DEV C++ For the beginning please include #include