#include <bits/stdc++.h>
using namespace std;
int n, a[5005], cnt[5], xia1;
char s[5005];
void solve(int now0, int now1, int now2) {
  for (register int i = 1; i <= n; ++i) {
    if (now0 && a[i] == 0) printf("%d ", i), now0--;
    if (now1 && a[i] == 1) printf("%d ", i), now1--;
    if (now2 && a[i] == 2) printf("%d ", i), now2--;
  }
}
int main() {
  cin >> n;
  scanf("%s", s + 1);
  for (register int i = 1; i <= n; ++i) {
    a[i] += s[i] - '0';
  }
  scanf("%s", s + 1);
  for (register int i = 1; i <= n; ++i) {
    a[i] += s[i] - '0';
    cnt[a[i]]++;
    xia1 += s[i] - '0';
  }
  for (register int now2 = 0; now2 <= cnt[2]; ++now2) {
    int now1 = xia1 - now2 - now2;
    int now0 = n / 2 - now1 - now2;
    if (now1 < 0 || now1 > cnt[1] || now0 < 0 || now0 > cnt[0]) continue;
    solve(now0, now1, now2);
    return 0;
  }
  puts("-1");
  return 0;
}
