func_code_string: #include <bits/stdc++.h>   using namespace std;   mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());   const long long mod = 998244353;   int LIMIT;   long long modpow(long long b, long long e) {     long long ans = 1;     for (; e; b = b * b % mod, e /= 2)       if (e & 1) ans = ans * b % mod;     return ans;   }   const long long root = 62;   inline void ntt(vector<long long>& a, vector<long long>& rt,                   vector<long long>& rev, int n) {     for (int i = 0; i < (n); ++i)       if (i < rev[i]) swap(a[i], a[rev[i]]);     for (int k = 1; k < n; k *= 2)       for (int i = 0; i < n; i += 2 * k)         for (int j = 0; j < (k); ++j) {           long long z = rt[j + k] * a[i + j + k] % mod, &ai = a[i + j];           a[i + j + k] = (z > ai ? ai - z + mod : ai - z);           ai += (ai + z >= mod ? z - mod : z);         }   }   vector<long long> conv(const vector<long long>& a, const vector<long long>& b) {     if (a.empty() || b.empty()) return {};     int s = (int)(a).size() + (int)(b).size() - 1, B = 32 - __builtin_clz(s),         n = 1 << B;     vector<long long> L(a), R(b), out(n), rt(n, 1), rev(n);     L.resize(n), R.resize(n);     for (int i = 0; i < (n); ++i) rev[i] = (rev[i / 2] | (i & 1) << B) / 2;     long long curL = mod / 2, inv = modpow(n, mod - 2);     for (int k = 2; k < n; k *= 2) {       long long z[] = {1, modpow(root, curL /= 2)};       for (int i = k; i < (2 * k); ++i) rt[i] = rt[i / 2] * z[i & 1] % mod;     }     ntt(L, rt, rev, n);     ntt(R, rt, rev, n);     for (int i = 0; i < (n); ++i)       out[-i & (n - 1)] = L[i] * R[i] % mod * inv % mod;     ntt(out, rt, rev, n);     return {out.begin(), out.begin() + s};   }   void read(int& n) {     n = 0;     char c = getchar();     while (c >=  0  && c <=  9 ) {       n = n * 10 + c -  0 ;       c = getchar();     }   }   vector<long long> t;   vector<long long> res[3000005];   vector<long long> s[3000005];   int a[200005];   int cnt[3000005];   priority_queue<pair<int, int> > pq;   int main() {     int n;     read(n);     LIMIT = n / 2 + 1;     for (int i = 1; i <= n; i++) {       read(a[i]);       cnt[a[i]]++;       s[a[i]].push_back(1);     }     for (int i = 1; i <= n; i++) {       if (cnt[a[i]]) {         s[a[i]].push_back(1);         pq.push({-cnt[a[i]], a[i]});         cnt[a[i]] = 0;       }     }     while (!pq.empty()) {       int v = pq.top().second;       pq.pop();       if (pq.empty()) {         cout << s[v][n / 2];         return 0;       }       int u = pq.top().second;       pq.pop();       s[v] = conv(s[v], s[u]);       while (s[v].size() > LIMIT) s[v].pop_back();       pq.push({-s[v].size(), v});     }   }   