#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 7;
char c1[N], a1[N];
int val[N];
int selected[N];
int main() {
  int n;
  cin >> n;
  cin >> c1;
  cin >> a1;
  int diff = 0;
  int cnt[3];
  cnt[0] = cnt[1] = cnt[2] = 0;
  for (int i = 0; i < n; i++) {
    if (c1[i] == '0' && a1[i] == '0')
      val[i] = 0;
    else if (c1[i] == '1' && a1[i] == '1')
      val[i] = 2;
    else
      val[i] = 1;
    cnt[val[i]]++;
    diff += c1[i] - '0';
  }
  int numOfSel = n / 2;
  int ansval[3];
  ansval[0] = ansval[1] = ansval[2] = -1;
  for (int z = 0; z <= cnt[2]; z++) {
    int y = diff - (2 * z);
    int x = (n / 2) - y - z;
    if (x >= 0 && y >= 0 && z >= 0 && x <= cnt[0] && y <= cnt[1] &&
        z <= cnt[2]) {
      ansval[0] = x;
      ansval[1] = y;
      ansval[2] = z;
      break;
    }
  }
  if (ansval[0] == -1) {
    printf("-1\n");
  } else {
    memset(selected, 0, sizeof selected);
    for (int i = 0; i < n; i++) {
      if (ansval[val[i]] > 0) {
        selected[i] = 1;
      }
      ansval[val[i]]--;
    }
    for (int i = 0; i < n; i++) {
      if (selected[i] == 0) printf("%d ", i + 1);
    }
  }
}
