P5828 Counting Edge-Biconnected Graphs

Find the number of labeled edge-biconnected graphs on $n$ vertices (simple undirected graphs where the whole graph is a single edge-biconnected component). Output the answer modulo $998244353$.

There are five lines in total. Each line contains one integer $n$, representing one query.

There are five lines in total. Each line contains one integer, representing the answer to one query.

Constraints: $1 \le n \le 10^5$. Translated by ChatGPT 5