Important Question!!!!!

Round 1

Questions: You are given an integer N. You have to create directed graphs, G with N vertices numbered from 1 to N which has no multi-edges or self-loops, and for any two vertices u,v of G, exactly one of the edges u→v and v→u exists.

Among the edges M are directed from a vertex with a smaller number to a vertex with a larger number.

Find the total number of strongly connected components over all such directed graphs G, modulo 998244353.