AND-OR Sum 2025

Problem Description

Little A has an integer $x$. He wants to find the smallest positive integer $y$ such that the following equation holds:

$(x \operatorname{and} y) + (x \operatorname{or} y) = 2025$

Here $\operatorname{and}$ denotes the bitwise AND operation and $\operatorname{or}$ denotes the bitwise OR operation. If no such $y$ exists, output $-1$.

Input Format

One line containing one integer $x$.

Output Format

One line containing one integer: if a satisfying $y$ exists, output $y$; otherwise output $-1$.

Sample Input

1025

Sample Output

1000

Sample Explanation

By a property of bitwise operations, for any integers $x, y$ we always have $(x \operatorname{and} y) + (x \operatorname{or} y) = x + y$.

Therefore the original equation is equivalent to $x + y = 2025$, which gives $y = 2025 - x$. When $x = 1025$, $y = 1000$, and $1000$ is a positive integer, so output $1000$.

Constraints

For all test cases, $0 \le x < 2025$.