#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 998244353;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int64 inv2 = (MOD + 1) / 2;
void fwt(vector<int>& a, int flag) {
  int n = a.size();
  for (int h = 1; h < n; h <<= 1) {
    for (int step = h << 1, i = 0; i < n; i += step) {
      for (int j = i; j < i + h; ++j) {
        int x = a[j], y = a[j + h];
        if (flag > 0) {
          a[j] = (x + y) % MOD;
          a[j + h] = (x - y + MOD) % MOD;
        } else {
          a[j] = (x + y) * inv2 % MOD;
          a[j + h] = (x - y + MOD) * inv2 % MOD;
        }
      }
    }
  }
}

void add(int& x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}

int64 power_mod(int64 a, int64 n, int p = MOD) {
  int64 ret = 1;
  for (; n; n >>= 1) {
    if (n & 1) ret = ret * a % p;
    a = a * a % p;
  }
  return ret;
}

int main() {
  int n;
  scanf("%d", &n);
  vector<int> p(1 << n);
  int sum = 0;
  for (int i = 0; i < (1 << n); ++i) {
    scanf("%d", &p[i]);
    add(sum, p[i]);
  }
  sum = power_mod(sum, MOD - 2);
  for (int i = 0; i < (1 << n); ++i) {
    p[i] = (int64)sum * p[i] % MOD;
  }
  add(p[0], MOD - 1);
  fwt(p, 1);
  vector<int> q(1 << n);
  for (int i = 0; i < (1 << n); ++i) {
    q[i] = MOD - 1;
  }
  add(q[0], 1 << n);
  fwt(q, 1);
  for (int i = 0; i < (1 << n); ++i) {
    q[i] = p[i] == 0 ? 0 : q[i] * power_mod(p[i], MOD - 2) % MOD;
  }
  fwt(q, -1);
  for (int i = (1 << n) - 1; i >= 0; --i) {
    add(q[i], MOD - q[0]);
  }
  for (int i = 0; i < (1 << n); ++i) {
    printf("%d\n", q[i]);
  }
  return 0;
}


Measured memory_bytes: 4864