代码:
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 7;
const int mod = 998244353;
int cnt[N], n, mx = -0x3f3f3f3f, ans = 1;
signed main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
int x;
cin >> x;
cnt[x]++;
mx = max(mx, x);
}
for (int i = 1; i < mx; i++)
{
if (cnt[i])
ans = ans * (cnt[i] + 1) % mod;
}
cout << ans;
return 0;
}