21121번 - Brave Seekers of Unicorns 다국어

문제

You are a member of the Brave Seekers of Unicorns (BSU), the secret magical order. The BSU is fond of seeking unicorns. Recently, they have agreed to call an array $a_1, a_2, \ldots, a_k$ of $k$ integers a unicorn if it satisfies the following conditions:

• the array is not empty ($k > 0$);
• there are no three consecutive elements with their bitwise XOR equal to zero ($a_i \oplus a_{i+1} \oplus a_{i+2} \ne 0$ for all 1ドル \le i \le k - 2$);
• the array is strictly increasing ($a_i < a_{i+1}$ for all 1ドル \le i \le k - 1$);
• the elements of the array are integers between 1ドル$ to $n,ドル inclusively (1ドル \le a_i \le n$ for all 1ドル \le i \le k$).

For example, if $n = 10,ドル then the array $[1, 4, 5, 9]$ is not a unicorn because 1ドル \oplus 4 \oplus 5 = 0,ドル but the array $[2, 4, 7, 9]$ is a unicorn.

The Grand Master of the BSU has commanded you to calculate the number of unicorns. Since the number can be pretty large, you must compute it modulo 998ドル,244円,353円$.

입력

The only line contains an integer $n$ (1ドル \le n \le 10^6$).

출력

Print the number of unicorns modulo 998ドル,244円,353円$.

제한

힌트