#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 <random>
#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>;

/*
  Q = {+-1, +-i, +-j, +-k} (quaternion)
  given a, b, c: Q -> \A s.t. a[+-1] = b[+-1] = c[+-1] = 0
  want tensor \sum[x,y,z\in Q] [xyz = -1] a[x] b[y] c[z]
  
  1-dimensional representation of Q:
    trivial
    sign, kernal <i>
    sign, kernal <j>
    sign, kernal <k>
  
  a'[i] := a[i] + a[-i], etc.
  
  + (+ a'[i] + a'[j] + a'[k]) (b...) (c...)
  - (- a'[i] + a'[j] + a'[k]) (b...) (c...)
  - (+ a'[i] - a'[j] + a'[k]) (b...) (c...)
  - (+ a'[i] + a'[j] - a'[k]) (b...) (c...)
  = 4 \sum[{x,y,z}={i,j,k}] a'[x] b'[y] c'[z]
  
  a''[i] := a[i] - a[-i], etc.
  want \sum[{x,y,z}={i,j,k}] (-xyz) a''[x] b''[y] c''[z]
  
  000    000    000    000    000    000
  00+    00+    00+    00+    00+    000
  0-0    000    000    000    000    000
                                        
  00-    00-    00-    ++0    000    000
  000 -> 000 -> 000 -> 000 -> 000 -> 000
  +00    ++0    ++0    ++0    000    000
                                        
  0+0    0+0    ++0    ++0    000    000
  -00    -00    000    000    000    000
  000    0+0    ++0    ++0    000    000
  
  - (a''[i] + a''[j] + a''[k]) b''[k] c''[j]
  - a''[k] (b''[j] + b''[k] + b''[i]) c''[i]
  - a''[j] b''[i] (c''[k] + c''[i] + c''[j])
  + (a''[j] + a''[k]) (b''[k] + b''[i]) (c''[i] + c''[j])
  + a''[i] b''[j] c''[k]
  
  O(9^N) time, O(6^N) space
*/

int N;
char S[11'000'000];

int SIX[10];
vector<Mint> f[10][9][3];

Mint rec(int n, int u) {
  if (n == 0) {
    return f[0][u][0][0] * f[0][u][1][0] * f[0][u][2][0];
  } else {
    --n;
#define rep(v) \
    for (int h = 0; h < SIX[n]; ++h) {\
      const Mint i0 = f[n + 1][u][v][h * 6 + 0];\
      const Mint j0 = f[n + 1][u][v][h * 6 + 1];\
      const Mint k0 = f[n + 1][u][v][h * 6 + 2];\
      const Mint k1 = f[n + 1][u][v][h * 6 + 3];\
      const Mint j1 = f[n + 1][u][v][h * 6 + 4];\
      const Mint i1 = f[n + 1][u][v][h * 6 + 5];\
      const Mint i = i0 + i1, ii = i0 - i1;\
      const Mint j = j0 + j1, jj = j0 - j1;\
      const Mint k = k0 + k1, kk = k0 - k1;\
      f[n][0][v][h] = i + j + k;\
      f[n][1][v][h] = j + k - i;\
      f[n][2][v][h] = k + i - j;\
      f[n][3][v][h] = i + j - k;\
    
    rep(0)
      f[n][4][0][h] = ii + jj + kk;
      f[n][5][0][h] = kk;
      f[n][6][0][h] = jj;
      f[n][7][0][h] = jj + kk;
      f[n][8][0][h] = ii;
    }
    rep(1)
      f[n][4][1][h] = kk;
      f[n][5][1][h] = jj + kk + ii;
      f[n][6][1][h] = ii;
      f[n][7][1][h] = kk + ii;
      f[n][8][1][h] = jj;
    }
    rep(2)
      f[n][4][2][h] = jj;
      f[n][5][2][h] = ii;
      f[n][6][2][h] = kk + ii + jj;
      f[n][7][2][h] = ii + jj;
      f[n][8][2][h] = kk;
    }
#undef rep
    Mint ret = 0;
    for (int uu = 0; uu < 1; ++uu) ret += rec(n, uu);
    for (int uu = 1; uu < 4; ++uu) ret -= rec(n, uu);
    for (int uu = 4; uu < 7; ++uu) ret -= 4 * rec(n, uu);
    for (int uu = 7; uu < 9; ++uu) ret += 4 * rec(n, uu);
    return ret;
  }
}

int main() {
  for (; ~scanf("%d", &N); ) {
    scanf("%s", S);
    
    SIX[0] = 1;
    for (int n = 1; n <= N; ++n) SIX[n] = SIX[n - 1] * 6;
    for (int n = 0; n < N; ++n) for (int u = 0; u < 9; ++u) for (int v = 0; v < 3; ++v) f[n][u][v].assign(SIX[n], 0);
    for (int v = 0; v < 3; ++v) f[N][0][v].assign(SIX[N], 0);
    for (int v = 0; v < 3; ++v) for (int h = 0; h < SIX[N]; ++h) f[N][0][v][h] = (S[h] - '0') & (S[SIX[N] - 1 - h] - '0');
    Mint ans = rec(N, 0);
    ans *= Mint(8).pow(-N);
    printf("%u\n", ans.x);
  }
  return 0;
}