#include <bits/stdc++.h>
using namespace std;
template <typename Tp>
void read(Tp &x) {
  x = 0;
  int op = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') op = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  x *= op;
}
template <typename Tp>
void CMax(Tp &x, Tp y) {
  if (y > x) x = y;
}
template <typename Tp>
void CMin(Tp &x, Tp y) {
  if (y < x) x = y;
}
const int N = (1 << 21) + 10;
int n, ppc[N];
char s[N];
unsigned long long a[N], b[N], c[N];
void FWTor(unsigned long long *f, int tp) {
  for (int l = 2, m = 1; l <= n; l <<= 1, m <<= 1) {
    for (int i = 0; i < n; i += l)
      for (int j = 0; j < m; ++j) {
        if (tp == 1)
          f[i + j + m] += f[i + j];
        else
          f[i + j + m] -= f[i + j];
      }
  }
}
int main() {
  read(n);
  n = (1 << n);
  for (int i = 1; i < n; ++i) ppc[i] = ppc[i - (i & -i)] + 1;
  for (int i = 0; i < n; ++i) ppc[i] *= 2;
  scanf("%s", s);
  for (int i = 0; i < n; ++i) a[i] = (s[i] & 15ll) * (1ll << ppc[i]);
  scanf("%s", s);
  for (int i = 0; i < n; ++i) b[i] = (s[i] & 15ll) * (1ll << ppc[i]);
  FWTor(a, 1);
  FWTor(b, 1);
  for (int i = 0; i < n; ++i) c[i] = a[i] * b[i];
  FWTor(c, -1);
  for (int i = 0; i < n; ++i) putchar(((c[i] >> ppc[i]) & 3) + 48);
  return 0;
}
