Problem Statement

Please calculate the maximum number of maximum cliques in a graph with $n$ nodes, taken modulo $998244353$.

Constraints

• $0\le n \le 10^{18}$
• All values in input are integers

8

18