#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } const ll MOD = 998244353; using mint = atcoder::modint998244353; ostream& operator<<(ostream& os, const mint& m){ os << m.val(); return os; } #define N_MAX 5005 mint inv[N_MAX],fac[N_MAX],finv[N_MAX]; mint stirling[N_MAX][N_MAX]; void init(){ fac[0]=1;fac[1]=1; finv[0]=1;finv[1]=1; inv[1]=1; for(int i=2;i v){ int sz = v.size(); for(int i = 0; i < sz; i++){ int others = 0; for(int j = 0; j < sz; j++){ if(i == j) continue; others |= v[j]; } if((others|v[i]) == others) return false; } return true; }; int ans = 0; for(int s = 0; s < (1< v; for(int i = 0; i < m; i++){ if(s&(1<> n; // cout << naive(n) << endl; mint ans = 1; for(int k = 1; k <= n; k++){ for(int x = k; x <= n; x++){ ans += comb(n, x)*stirling[x][k]*((mint(2).pow(k)-k).pow(n-x)); } } cout << ans << endl; }