Codeforces Round #779.B. Marin and Anti-coprime Permutation

Marin wants you to count number of permutations that are beautiful. A beautiful permutation of length nn is a permutation that has the following property:

gcd(1⋅p1,2⋅p2,…,n⋅pn)>1,gcd(1⋅p1,2⋅p2,…,n⋅pn)>1,

where gcdgcd is the greatest common divisor.

A permutation is an array consisting of nn distinct integers from 11 to nn in arbitrary order. For example, [2,3,1,5,4][2,3,1,5,4] is a permutation, but [1,2,2][1,2,2] is not a permutation (22 appears twice in the array) and [1,3,4][1,3,4] is also not a permutation (n=3n=3 but there is 44 in the array).

Input

The first line contains one integer tt (1≤t≤1031≤t≤103) — the number of test cases.

Each test case consists of one line containing one integer nn (1≤n≤1031≤n≤103).

Output

For each test case, print one integer — number of beautiful permutations. Because the answer can be very big, please print the answer modulo 998244353998244353.

首先考虑不带系数的情况，要使数列的最大公因数为2则只有n/2的数满足，剩下一半不满足，所以我们使用系数来使得剩下的一半数满足条件，如果最大公因数为3，我们会发现无论如何都达不到要求，则我们知道最大公因数最多为2，而且还只有偶数状态下的才够刚好凑齐n个，奇数情况只能凑齐n-1个有2位因子的数。

#include<bits/stdc++.h>
#define int long long
using namespace std;
int _,n,m,t,x,y,z,k=-1,kljn,b[222222],c[222222],s,sum;
vector<int>a[222222];
signed main()
{
    cin>>_;
    while(_--) {
        cin>>x;
        if(x%2)cout<<"0"<<endl;
        else {
            int sum=1;
            for(int i=2; i<=x/2; i++)
                sum=sum*i%998244353;
            cout<<sum*sum%998244353<<endl;
        }
    }
}