import sys
from collections import deque, Counter
from math import gcd, log10, pi, sqrt, ceil
from bisect import bisect, bisect_left, bisect_right, insort
from typing import Iterable, TypeVar, Union, Tuple, Iterator, List
import copy
import heapq
import itertools
import math
import random
from fractions import Fraction
from functools import lru_cache, partial, cmp_to_key
import operator
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
mod = 998244353
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]


def main():
    N = int(input())

    T = {}
    for n in range(2, int(N ** 0.5) + 1):
        while N % n == 0:
            T[n] = T.get(n, 0) + 1
            N //= n

    if N > 1:
        T[N] = T.get(N, 0) + 1 

    T = list(T.items())
    X = {}
    V = set()

    def f(s, S):
        if len(S) == len(T):
            V.add(s)
            X[s] = (tuple(S))
            return
        
        k, v = T[len(S)] 
        S.append(0)
        for _ in range(v + 1):
            f(s, S)
            s *= k
            S[-1] += 1
        S.pop()
        s //= k ** v
    
    f(1, [])

    N = len(V)
    V = sorted(list(V))
    X = [X[v] for v in V]
    dp = [0] * N
    dp[0] = 1
    for i in range(N):
        for j in range(i + 1, N):
            r = 1
            for x1, x2 in zip(X[i], X[j]):
                if x2 > x1:
                    continue
                elif x2 == x1:
                    r *= x1 + 1
                    r %= mod
                else:
                    break
            else:
                dp[j] += dp[i] * r % mod
                dp[j] %= mod
    
    print(dp[-1])


if __name__ == "__main__":
    main()