Problem: 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:

<image>

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≤ n ≤ 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: 

<image>

In the third example, the good pairings are: 

<image>

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class codeforces4 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		System.out.println(findPairs(n));
		sc.close();
	}
	public static int findPairs(int n) {
		int arr[] = new int[n+1];
		fillDivisibleCount(arr,n);
		int dp[] = new int[n+1];
		dp[0] = 1;
		dp[1] = 1;
		find(n, arr, dp);
		return dp[n]%998244353;
	}
	public static void find(int n, int[] arr, int[] dp) {
		int i;
		int sum = dp[0] + dp[1];
		for(i=2; i<=n; i++) {
			dp[i] = (sum + arr[i])%998244353;
			sum = (sum + dp[i])%998244353;
		}
		
	}
	public static void fillDivisibleCount(int[] arr, int n) {
		int i,j;
		for(i=1; i<=n/2; i++) {
			for(j=2; j*i <= n; j++) {
				arr[j*i]++;
			}
		}
	}

}