#include <bits/stdc++.h>
using namespace std;
char buf[1 << 15], *p1 = buf, *p2 = buf;
inline long long read() {
  char ch;
  bool flag = 0;
  long long res;
  while (!isdigit(
      ch = (p1 == p2 &&
                    (p2 = (p1 = buf) + fread(buf, 1, 1 << 15, stdin), p1 == p2)
                ? EOF
                : *p1++)))
    (ch == '-') && (flag = true);
  for (res = ch - '0'; isdigit(
           ch = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 15, stdin),
                             p1 == p2)
                     ? EOF
                     : *p1++));
       res = res * 10ll + ch - '0')
    ;
  (flag) && (res = -res);
  return res;
}
inline void write(long long x) {
  if (x < 0) x = ~x + 1ll, putchar('-');
  if (x > 9) write(x / 10ll);
  putchar(x % 10ll + '0');
}
long long a[(1 << 21) + 100], b[(1 << 21) + 100];
char s[(1 << 21) + 100];
long long fpow(long long a, long long v, long long mod) {
  long long ans = 1;
  while (v) {
    if (v & 1) ans = a * ans % mod;
    v >>= 1;
    a = a * a % mod;
  }
  return ans;
}
long long v[(1 << 21) + 100];
void fwt(long long *a, int n, long long t) {
  for (int p = 2, q = 1; p <= n; p <<= 1, q <<= 1) {
    for (int i = 0; i < n; i += p) {
      for (int j = 0; j < q; j++) {
        a[i + j + q] += a[i + j] * t;
      }
    }
  }
}
void solve() {
  int n;
  v[0] = 1;
  cin >> n;
  scanf("%s", s);
  for (register int i = (0); i <= ((1 << n) - 1); i++) {
    a[i] = s[i] - '0';
    int tmp = i;
    v[i] = 1;
    while (tmp) {
      if (tmp & 1) v[i] *= 4;
      tmp >>= 1;
    }
    a[i] = a[i] * v[i];
  }
  scanf("%s", s);
  for (register int i = (0); i <= ((1 << n) - 1); i++)
    b[i] = s[i] - '0', b[i] = b[i] * v[i];
  fwt(a, (1 << n), 1);
  fwt(b, (1 << n), 1);
  for (register int i = (0); i <= ((1 << n) - 1); i++) a[i] = a[i] * b[i];
  fwt(a, (1 << n), -1);
  for (register int i = (0); i <= ((1 << n) - 1); i++) a[i] = a[i] / v[i];
  for (register int i = (0); i <= ((1 << n) - 1); i++)
    printf("%lld", (a[i]) & 3);
  return;
}
int main() {
  solve();
  return 0;
}
