Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Kavi on Pairing Duty

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputKavi has $$$2n$$$ points lying on the $$$OX$$$ axis, $$$i$$$-th of which is located at $$$x = i$$$.

Kavi considers all ways to split these $$$2n$$$ points into $$$n$$$ pairs. Among those, he is interested in good pairings, which are defined as follows:

Consider $$$n$$$ segments with ends at the points in correspondent pairs. The pairing is called good, if for every $$$2$$$ different segments $$$A$$$ and $$$B$$$ among those, at least one of the following holds:

- One of the segments $$$A$$$ and $$$B$$$ lies completely inside the other.
- $$$A$$$ and $$$B$$$ have the same length.

Consider the following example:

$$$A$$$ is a good pairing since the red segment lies completely inside the blue segment.

$$$B$$$ is a good pairing since the red and the blue segment have the same length.

$$$C$$$ is not a good pairing since none of the red or blue segments lies inside the other, neither do they have the same size.

Kavi is interested in the number of good pairings, so he wants you to find it for him. As the result can be large, find this number modulo $$$998244353$$$.

Two pairings are called different, if some two points are in one pair in some pairing and in different pairs in another.

Input

The single line of the input contains a single integer $$$n$$$ $$$(1\le n \le 10^6)$$$.

Output

Print the number of good pairings modulo $$$998244353$$$.

Examples

Input

1

Output

1

Input

2

Output

3

Input

3

Output

6

Input

100

Output

688750769

Note

The good pairings for the second example are:

In the third example, the good pairings are:

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/13/2021 16:51:35 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|