#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = priority_queue<A,vector<A>,greater<A>>;
using Modint = atcoder::static_modint<998244353>;
//#include "nachia/vec.hpp"

void testcase(){
    int K; cin >> K;
    int N = 500;
    vector<Modint> powK(N+1);
    rep(i,N+1) powK[i] = Modint(i).pow(K);
    vector<Modint> Fact(N+1); Fact[0] = 1;
    for(int i=1; i<=N; i++) Fact[i] = Fact[i-1] * Modint::raw(i);
    vector<Modint> InvFactSq(N+1); InvFactSq[N] = (Fact[N] * Fact[N]).inv();
    for(int i=N; i>=1; i--) InvFactSq[i-1] = InvFactSq[i] * Modint::raw(i) * Modint::raw(i);
    vector<Modint> ans(N+1);
    for(int a=1; a*3<=N; a++) for(int b=a; a+b+b<=N; b++) for(int c=b; a+b+c<=N; c++){
        int n = a + b + c;
        Modint q = Modint(c-b+1) * Modint(b-a+1) * Modint(c-a+2);
        Modint x = InvFactSq[a] * InvFactSq[b+1] * InvFactSq[c+2] * Fact[n] * Fact[n] * q * q;
        ans[n] += powK[c] * x;
    }
    cout << N << '\n';
    rep(i,N){
        if(i) cout << ' ';
        cout << ans[i+1].val();
    } cout << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}