Curzon Number


There is an integer n given. You have to find whether it is a Curzon number or not. Curzon number is said to be Curzon when 2n +1 is divisible by 2 * n +1.

Write a function solve that should return "true" if n is Curzon and "false" if it is not.
Function should have the following parameter(s):
1.) a = an integer

Example
Input:
a = 5
Output:
The function will return,
True

Explanation
1+2^5=33
1+2*5=11
As 33 is divisible by 11 so, 5 is a Curzon number.

Input:
a = 10
Output:
The function will return,
False

Explanation
1+2^10=1025
1+2*10=21
As 1025 is not divisible by 21, so 10 is not a Curzon number.

Constraints
• The 'n' will always be non-negative.
• The 'n' will always greater than 1 and less than 1 million.