Y_UME has just found a number $x$ in his right pocket. The number is a non-negative integer ranging from $0$ to $2^n - 1$ inclusively. You want to know the exact value of this number. Y_UME has super power, and he can answer several questions at the same time. You can ask him as many questions as you want. But you must ask all questions simultaneously. In the $i$-th question, you give him an integer $y_i$ ranging from $0$ to $2^n - 1$ inclusively, and he will answer you if $x \& y_i$ equals to $y_i$ or not. Note that each question you ask has a index number. Namely, the questions are ordered in certain aspect. Note that Y_UME answer all questions at the same time, which implies that you could not make any decision on the remaining questions you could ask according to some results of some of the questions.

You want to get the exact value of $x$ and then minimize the number of questions you will ask. How many different methods may you use with only minimum number of questions to get the exact value of $x$? You should output the number of methods modulo $10^6 + 3$.

Two methods differ if and only if they have different number of questions or there exsits some $i$ satisfying that the $i$-th question of the first method is not equal to the $i$-th of the second one.

There are multiple test cases.

Each case starts with a line containing one positive integer $n(n \leq 10^9)$.

For each test case, output one line containing an integer denoting the answer.