#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define popcount __builtin_popcount using namespace std; typedef long long ll; typedef pair P; const ll MOD=998244353; ll powmod(ll a, ll k){ ll ap=a, ans=1; while(k){ if(k&1){ ans*=ap; ans%=MOD; } ap=ap*ap; ap%=MOD; k>>=1; } return ans; } ll inv(ll a){ return powmod(a, MOD-2); } ll f[2000010], invf[2000010]; void fac(int n){ f[0]=1; for(ll i=1; i<=n; i++) f[i]=f[i-1]*i%MOD; invf[n]=inv(f[n]); for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD; } ll comb(int x, int y){ if(!(0<=y && y<=x)) return 0; return f[x]*invf[y]%MOD*invf[x-y]%MOD; } template struct BIT{ vector bit; int size; BIT(int n):size(n), bit(n+1, 0){} T sum(int i){ //[0, i) T s=0; while(i>0){ s+=bit[i]; s%=MOD; i-=(i&(-i)); } return s; } T sum(int l, int r){ //[l, r) return (sum(r)-sum(l)+MOD)%MOD; } void add(int i, T x){ i++; while(i<=size){ bit[i]+=x; bit[i]%=MOD; i+=(i&(-i)); } } }; int main() { int n; cin>>n; ll a[200020]; vector v(n); for(int i=0; i>a[i]; a[i]%=MOD; v[i]=a[i]; } sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); int m=v.size(); for(int i=0; i bit(m), bit2(m), bit3(m), bit4(m), bit5(m); ll ans=0; for(int i=0; i