CF1528B.Kavi on Pairing Duty

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Kavi 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.

输入格式

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

输出格式

Print the number of good pairings modulo $998244353$ .

输入输出样例

输入#1
```
1
```
输出#1
```
1
```
输入#2
```
2
```
输出#2
```
3
```
输入#3
```
3
```
输出#3
```
6
```
输入#4
```
100
```
输出#4
```
688750769
```

说明/提示

The good pairings for the second example are:

In the third example, the good pairings are:

首页