#include <bits/stdc++.h>
using namespace std;
int n, P[5005], PP[5005], na, nb, nc, nd;
void print_sol(int a, int b, int c, int d) {
  for (int i = 0; i < n; i++) {
    if (P[i] == 0 && PP[i] == 0 && a > 0) {
      cout << i + 1 << " ";
      a--;
    }
    if (P[i] == 0 && PP[i] == 1 && b > 0) {
      cout << i + 1 << " ";
      b--;
    }
    if (P[i] == 1 && PP[i] == 0 && c > 0) {
      cout << i + 1 << " ";
      c--;
    }
    if (P[i] == 1 && PP[i] == 1 && d > 0) {
      cout << i + 1 << " ";
      d--;
    }
  }
  cout << endl;
}
int main() {
  string s;
  cin >> n;
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    P[i] = s[i] - '0';
  }
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    PP[i] = s[i] - '0';
  }
  for (int i = 0; i < n; i++) {
    if (P[i] == 0 && PP[i] == 0) {
      na++;
    }
    if (P[i] == 0 && PP[i] == 1) {
      nb++;
    }
    if (P[i] == 1 && PP[i] == 0) {
      nc++;
    }
    if (P[i] == 1 && PP[i] == 1) {
      nd++;
    }
  }
  int a, b, c, d;
  for (a = 0; a <= na; a++) {
    for (b = 0; b <= nb; b++) {
      d = a + nb + nd - (n / 2);
      c = nb + nd - 2 * d - b;
      if (c >= 0 && c <= nc && d >= 0 && d <= nd &&
          (a + b + c + d) == (n / 2)) {
        print_sol(a, b, c, d);
        return 0;
      }
    }
  }
  cout << -1 << endl;
}
