#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

// ============

#include <cassert>
#include <iostream>
#include <type_traits>

// ============

constexpr bool is_prime(unsigned n) {
    if (n == 0 || n == 1) {
        return false;
    }
    for (unsigned i = 2; i * i <= n; ++i) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

constexpr unsigned mod_pow(unsigned x, unsigned y, unsigned mod) {
    unsigned ret = 1, self = x;
    while (y != 0) {
        if (y & 1) {
            ret = (unsigned) ((unsigned long long) ret * self % mod);
        }
        self = (unsigned) ((unsigned long long) self * self % mod);
        y /= 2;
    }
    return ret;
}

template <unsigned mod>
constexpr unsigned primitive_root() {
    static_assert(is_prime(mod), "`mod` must be a prime number.");
    if (mod == 2) {
        return 1;
    }

    unsigned primes[32] = {};
    int it = 0;
    {
        unsigned m = mod - 1;
        for (unsigned i = 2; i * i <= m; ++i) {
            if (m % i == 0) {
                primes[it++] = i;
                while (m % i == 0) {
                    m /= i;
                }
            }
        }
        if (m != 1) {
            primes[it++] = m;
        }
    }
    for (unsigned i = 2; i < mod; ++i) {
        bool ok = true;
        for (int j = 0; j < it; ++j) {
            if (mod_pow(i, (mod - 1) / primes[j], mod) == 1) {
                ok = false;
                break;
            }
        }
        if (ok)
            return i;
    }
    return 0;
}

// y >= 1
template <typename T>
constexpr T safe_mod(T x, T y) {
    x %= y;
    if (x < 0) {
        x += y;
    }
    return x;
}

// y != 0
template <typename T>
constexpr T floor_div(T x, T y) {
    if (y < 0) {
        x *= -1;
        y *= -1;
    }
    if (x >= 0) {
        return x / y;
    } else {
        return -((-x + y - 1) / y);
    }
}

// y != 0
template <typename T>
constexpr T ceil_div(T x, T y) {
    if (y < 0) {
        x *= -1;
        y *= -1;
    }
    if (x >= 0) {
        return (x + y - 1) / y;
    } else {
        return -(-x / y);
    }
}
// ============

template <unsigned mod>
class ModInt {
    static_assert(mod != 0, "`mod` must not be equal to 0.");
    static_assert(
        mod < (1u << 31),
        "`mod` must be less than (1u << 31) = 2147483648.");

    unsigned val;

public:
    static constexpr unsigned get_mod() {
        return mod;
    }
    
    constexpr ModInt() : val(0) {}
    template <typename T, std::enable_if_t<std::is_signed_v<T>> * = nullptr>
    constexpr ModInt(T x) : val((unsigned) ((long long) x % (long long) mod + (x < 0 ? mod : 0))) {}
    template <typename T, std::enable_if_t<std::is_unsigned_v<T>> * = nullptr>
    constexpr ModInt(T x) : val((unsigned) (x % mod)) {}

    static constexpr ModInt raw(unsigned x) {
        ModInt<mod> ret;
        ret.val = x;
        return ret;
    }

    constexpr unsigned get_val() const {
        return val;
    }

    constexpr ModInt operator+() const {
        return *this;
    }
    constexpr ModInt operator-() const {
        return ModInt<mod>(0u) - *this;
    }

    constexpr ModInt &operator+=(const ModInt &rhs) {
        val += rhs.val;
        if (val >= mod)
            val -= mod;
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt &rhs) {
        val -= rhs.val;
        if (val >= mod)
            val += mod;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt &rhs) {
        val = (unsigned long long)val * rhs.val % mod;
        return *this;
    }
    constexpr ModInt &operator/=(const ModInt &rhs) {
        val = (unsigned long long)val * rhs.inv().val % mod;
        return *this;
    }

    friend constexpr ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) += rhs;
    }
    friend constexpr ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) -= rhs;
    }
    friend constexpr ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) *= rhs;
    }
    friend constexpr ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) /= rhs;
    }

    constexpr ModInt pow(unsigned long long x) const {
        ModInt<mod> ret = ModInt<mod>::raw(1);
        ModInt<mod> self = *this;
        while (x != 0) {
            if (x & 1)
                ret *= self;
            self *= self;
            x >>= 1;
        }
        return ret;
    }
    constexpr ModInt inv() const {
        static_assert(is_prime(mod), "`mod` must be a prime number.");
        assert(val != 0);
        return this->pow(mod - 2);
    }

    friend std::istream &operator>>(std::istream &is, ModInt<mod> &x) {
        long long val;
        is >> val;
        x.val = val % mod + (val < 0 ? mod : 0);
        return is;
    }

    friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &x) {
        os << x.val;
        return os;
    }

    friend bool operator==(const ModInt &lhs, const ModInt &rhs) {
        return lhs.val == rhs.val;
    }
    
    friend bool operator!=(const ModInt &lhs, const ModInt &rhs) {
        return lhs.val != rhs.val;
    }
};

[[maybe_unused]] constexpr unsigned mod998244353 = 998244353;
[[maybe_unused]] constexpr unsigned mod1000000007 = 1000000007;

// ============
// ============
#include <algorithm>
// ============
#include <cassert>
#include <vector>

template <typename T>
std::vector<T> characteristic_polynomial(std::vector<std::vector<T>> a) {
    int n = (int)a.size();
    for (int i = 0; i < n; ++i) {
        assert((int)a[i].size() == n);
    }
    for (int i = 0; i < n - 2; ++i) {
        int idx = -1;
        for (int j = i + 2; j < n; ++j) {
            if (a[j][i] != T()) {
                idx = j;
                break;
            }
        }
        if (idx == -1) {
            continue;
        }
        std::swap(a[i + 1], a[idx]);
        for (int j = 0; j < n; ++j) {
            std::swap(a[j][i + 1], a[j][idx]);
        }
        T inv = a[i + 1][i].inv();
        for (int j = i + 2; j < n; ++j) {
            T mul = a[j][i] * inv;
            for (int k = i; k < n; ++k) {
                a[j][k] -= a[i + 1][k] * mul;
            }
            for (int k = 0; k < n; ++k) {
                a[k][i + 1] += a[k][j] * mul;
            }
        }
    }
    std::vector<std::vector<T>> pol(n + 1);
    pol[0].resize(1, T(1));
    for (int i = 0; i < n; ++i) {
        pol[i + 1].resize(i + 2, T());
        for (int j = 0; j < i + 1; ++j) {
            pol[i + 1][j + 1] += pol[i][j];
            pol[i + 1][j] -= pol[i][j] * a[i][i];
        }
        T prod(1);
        for (int j = i - 1; j >= 0; --j) {
            prod *= a[j + 1][j];
            T coeff = prod * -a[j][i];
            for (int k = 0; k < j + 1; ++k) {
                pol[i + 1][k] += pol[j][k] * coeff;
            }
        }
    }
    return pol[n];
}
// ============

template <typename T>
std::vector<T> det_a_plus_xb(std::vector<std::vector<T>> a, std::vector<std::vector<T>> b) {
    int n = (int)a.size();
    assert((int)b.size() == n);
    for (int i = 0; i < n; ++i) {
        assert((int)a.size() == n);
        assert((int)b.size() == n);
    }
    int mulx = 0;
    T fin(1);
    for (int i = 0; i < n; ++i) {
        int idx = -1;
        for (int j = i; j < n; ++j) {
            if (b[j][i] != T()) {
                idx = j;
                break;
            }
        }
        while (idx == -1 && mulx < n) {
            for (int j = 0; j < i; ++j) {
                T mul = std::exchange(b[j][i], T());
                for (int k = 0; k < n; ++k) {
                    a[k][i] -= a[k][j] * mul;
                }
            }
            ++mulx;
            for (int j = 0; j < n; ++j) {
                std::swap(a[j][i], b[j][i]);
            }
            for (int j = i; j < n; ++j) {
                if (b[j][i] != T()) {
                    idx = j;
                    break;
                }
            }
        }
        if (idx == -1) {
            return std::vector<T>(n + 1, T());
        }
        if (idx != i) {
            std::swap(a[idx], a[i]);
            std::swap(b[idx], b[i]);
            fin = -fin;
        }
        fin *= b[i][i];
        T inv = b[i][i].inv();
        for (int j = i; j < n; ++j) {
            b[i][j] *= inv;
        }
        for (int j = 0; j < n; ++j) {
            a[i][j] *= inv;
        }
        for (int j = 0; j < n; ++j) {
            if (j == i) {
                continue;
            }
            T mul = b[j][i];
            for (int k = i; k < n; ++k) {
                b[j][k] -= b[i][k] * mul;
            }
            for (int k = 0; k < n; ++k) {
                a[j][k] -= a[i][k] * mul;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            a[i][j] = -a[i][j];
        }
    }
    std::vector<T> ans = characteristic_polynomial(a);
    for (int i = mulx; i <= n; ++i) {
        ans[i] *= fin;
    }
    std::rotate(ans.begin(), ans.begin() + mulx, ans.end());
    return ans;
}
// ============
using M = ModInt<mod998244353>;

int main() {
    i32 n;
    cin >> n;
    Vec<Vec<M>> a(n, Vec<M>(n));
    Vec<Vec<M>> b(n, Vec<M>(n));
    REP(i, n) REP(j, n) {
        cin >> a[i][j];
    }
    REP(i, n) REP(j, n) {
        cin >> b[i][j];
    }
    Vec<M> ans = det_a_plus_xb(a, b);
    REP(i, n + 1) {
        cout << ans[i] << '\n';
    }
}