#include <bits/stdc++.h>
int cnt[4], ans[4], c = 1;
char S[10000], T[10000];
int n;
int main() {
  scanf("%d%s%s", &n, S, T);
  for (int i = 0; i < n; i++) cnt[(S[i] & 1) << 1 | (T[i] & 1)]++;
  for (int d = 0; d <= cnt[3]; d++) {
    int a = (n >> 1) + d - cnt[1] - cnt[3];
    if (0 <= a && a <= cnt[0]) {
      int Sbc = cnt[1] + cnt[3] - 2 * d;
      if (0 <= Sbc && Sbc <= cnt[1] + cnt[2]) {
        ans[0] = a, ans[3] = d;
        ans[1] = std::min(Sbc, cnt[1]);
        ans[2] = Sbc - ans[1];
        c = 0;
      }
    }
  }
  if (c)
    puts("-1");
  else {
    for (int i = 0; i < n; i++) {
      int v = (S[i] & 1) << 1 | (T[i] & 1);
      if (ans[v]) printf("%d ", i + 1), ans[v]--;
    }
  }
}
