#include using namespace std; using ll = long long; // #define int ll using PII = pair; #define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i) #define REP(i, n) FOR(i, 0, n) #define ALL(x) x.begin(), x.end() template T &chmin(T &a, const T &b) { return a = min(a, b); } template T &chmax(T &a, const T &b) { return a = max(a, b); } template bool IN(T a, T b, T x) { return a<=x&&x T ceil(T a, T b) { return a/b + !!(a%b); } template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a,Ts... ts) { return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value==0>::type fill_v(T &t, const V &v) { t=v; } template typename enable_if::value!=0>::type fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); } template ostream &operator <<(ostream& out,const pair& a){ out<<'('< istream& operator >> (istream& is, vector& vec){ for(T& x: vec) {is >> x;} return is; } template ostream &operator <<(ostream& out,const vector& a){ out<<'['; for(T i: a) {out<> n; vector cnt(5000); REP(i, n) { ll a; cin >> a; cnt[a]++; } vector dp(n+1); dp[0] = 1; REP(i, n) for(ll j=i; j>=0; --j) { (dp[j+1] += dp[j] * cnt[i] % MOD) %= MOD; } ll ret = 0, fact = 1; for(ll i=n; i>=0; --i) { if(i%2) (ret += MOD - dp[i] * fact % MOD) %= MOD; else (ret += dp[i] * fact % MOD) %= MOD; (fact *= n-i+1) %= MOD; } cout << ret << endl; return 0; }