13221322 SUSTech Online Judge
Problem 1322 --Discrete Math Is Simple

## 1322: Discrete Math Is Simple

Time Limit: 5 Sec  Memory Limit: 512 MB
Submit: 12  Solved: 4
[Submit][Status][Web Board]

## Input

The first line contains an integer $$T(1\leq T \leq 10^4)$$, denoting the number of test cases.

For each test case, there's an integer $$n(2\leq n \leq 10^8)$$.

## Output

The answer can be represented as a fraction $$\frac{Q}{P}$$, where $$gcd(P,Q)=1$$ and $$P,Q>0$$. You only need to print $$Q·P^{-1}$$ mod $$998244353$$ for each test case in a single line.

## Sample Input

3
2
3
4

## Sample Output

499122177
1
831870295

[Submit][Status]