#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


vector<vector<Mint>> inverse(vector<vector<Mint>> a) {
  const int n = a.size();
  vector<vector<Mint>> b(n, vector<Mint>(n, 0));
  for (int i = 0; i < n; ++i) b[i][i] = 1;
  for (int h = 0; h < n; ++h) {
    for (int i = h; i < n; ++i) if (a[i][h]) {
      swap(a[h], a[i]);
      swap(b[h], b[i]);
      break;
    }
    // assert(a[h][h]);
    if (!a[h][h]) return {};
    const Mint s = a[h][h].inv();
    for (int j = h + 1; j < n; ++j) a[h][j] *= s;
    for (int j = 0; j < n; ++j) b[h][j] *= s;
    for (int i = h + 1; i < n; ++i) {
      const Mint t = a[i][h];
      if (t) {
        for (int j = h + 1; j < n; ++j) a[i][j] -= t * a[h][j];
        for (int j = 0; j < n; ++j) b[i][j] -= t * b[h][j];
      }
    }
  }
  for (int h = n; --h >= 0; ) for (int i = 0; i < h; ++i) {
    const Mint t = a[i][h];
    if (t) for (int j = 0; j < n; ++j) b[i][j] -= t * b[h][j];
  }
  return b;
}


/*
  Pr[u -> v] = (1/M) [u = v] + \sum[i] (C[i]/M) Pr[u i -> v]
  ans[v] = Pr[id -> v]
  
  Pr[u -> v] = ans[u^-1 v]
  ans[u^-1 v] = (1/M) [u = v] + \sum[i] (C[i]/M) ans[i^-1 u^-1 v]
  ans[u] = (1/M) [u = i] + \sum[i] (C[i]/M) ans[i^-1 u]
  ans = (1/M) + (C/M) * ans
  ans = (M - C)^-1
  
  K[S_3] \cong K * K * Mat_2(K)
  trivial representation
    p -> 1
  sign representation
    p -> sgn(p)
  standard representation
    V = {(x[0], x[1], x[2]) | x[0] + x[1] + x[2] = 0}
    p: (x[0], x[1], x[2]) -> (x[p[0]], x[p[1]], x[p[2]])
    basis: ((1, 0, -1), (0, 1, -1))
*/

// 012, 021, 102, 120, 201, 210
constexpr int W[6][6] = {
  // trivial
  {1, 1, 1, 1, 1, 1},
  // sign
  {+1, -1, -1, +1, +1, -1},
  // standard
  {1, 1, 0, 0, -1, -1}, {0, 0, 1, 1, -1, -1},
  {0, -1, 1, -1, 1, 0}, {1, -1, 0, -1, 0, 1},
};
// 6 W^-1
constexpr int INV_W[6][6] = {
  {1, 1, 2, 0, 0, 2},
  {1, -1, 2, -2, 0, -2},
  {1, -1, 0, 2, 2, 0},
  {1, 1, -2, 2, -2, 0},
  {1, 1, 0, -2, 2, -2},
  {1, -1, -2, 0, -2, 2},
};


constexpr int MAX_N = 8;

int SIX[MAX_N + 1];

int N;
vector<Mint> C;

int main() {
  SIX[0] = 1;
  for (int e = 1; e <= MAX_N; ++e) SIX[e] = SIX[e - 1] * 6;
cerr<<"SIX = ";pv(SIX,SIX+MAX_N+1);
  
  for (; ~scanf("%d", &N); ) {
    C.resize(SIX[N]);
    for (int i = 0; i < SIX[N]; ++i) {
      scanf("%u", &C[i].x);
    }
    
    Mint M = 1;
    for (int i = 0; i < SIX[N]; ++i) {
      M += C[i];
    }
    vector<Mint> cs(SIX[N], 0);
    cs[0] += M;
    for (int i = 0; i < SIX[N]; ++i) {
      cs[i] -= C[i];
    }
    
    // DFT
    for (int e = 0; e < N; ++e) {
      for (int i = 0; i < SIX[N]; i += SIX[e + 1]) {
        for (int j = 0; j < SIX[e]; ++j) {
          Mint fs[6], gs[6];
          for (int p = 0; p < 6; ++p) fs[p] = cs[i + j + p * SIX[e]];
          fill(gs, gs + 6, 0);
          for (int p = 0; p < 6; ++p) for (int q = 0; q < 6; ++q) gs[p] += W[p][q] * fs[q];
          for (int p = 0; p < 6; ++p) cs[i + j + p * SIX[e]] = gs[p];
        }
      }
    }
    // pointwise inv
    int ids[1 << MAX_N][1 << MAX_N];
    for (int i = 0; i < SIX[N]; ++i) {
      int ps[MAX_N];
      for (int e = 0; e < N; ++e) {
        ps[e] = i / SIX[e] % 6;
      }
      if (*max_element(ps, ps + N) < 3) {
        int esLen = 0;
        int es[MAX_N];
        for (int e = 0; e < N; ++e) if (ps[e] == 2) {
          es[esLen++] = e;
        }
        vector<vector<Mint>> a(1 << esLen, vector<Mint>(1 << esLen));
        for (int x = 0; x < 1 << esLen; ++x) for (int y = 0; y < 1 << esLen; ++y) {
          int &ii = ids[x][y];
          ii = i;
          for (int j = 0; j < esLen; ++j) {
            if (x & 1 << j) ii += 2 * SIX[es[j]];
            if (y & 1 << j) ii += SIX[es[j]];
          }
          a[x][y] = cs[ii];
        }
        a = inverse(a);
        if (a.empty()) {
          goto failed;
        }
        for (int x = 0; x < 1 << esLen; ++x) for (int y = 0; y < 1 << esLen; ++y) {
          cs[ids[x][y]] = a[x][y];
        }
      }
    }
    // inverse DFT
    for (int e = 0; e < N; ++e) {
      for (int i = 0; i < SIX[N]; i += SIX[e + 1]) {
        for (int j = 0; j < SIX[e]; ++j) {
          Mint fs[6], gs[6];
          for (int p = 0; p < 6; ++p) fs[p] = cs[i + j + p * SIX[e]];
          fill(gs, gs + 6, 0);
          for (int p = 0; p < 6; ++p) for (int q = 0; q < 6; ++q) gs[p] += INV_W[p][q] * fs[q];
          for (int p = 0; p < 6; ++p) cs[i + j + p * SIX[e]] = gs[p];
        }
      }
    }
    
    {
      const Mint invSix = Mint(SIX[N]).inv();
      unsigned key = 0;
      for (int i = 0; i < SIX[N]; ++i) {
        cs[i] *= invSix;
        key ^= cs[i].x;
      }
// cerr<<"cs = "<<cs<<endl;
      printf("%u\n", key);
    }
    continue;
   failed:{}
    puts("-1");
  }
  return 0;
}