#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int n;
vector<pair<char, char> > vec;
vector<int> ans, ans2;
string sa, sb;
void no() {
  cout << -1 << "\n";
  exit(0);
}
queue<int> a, b, c, d;
void solve(int aa, int bb, int cc, int dd) {
  vector<int> ans;
  while (aa) {
    ans.push_back(a.front());
    a.pop();
    aa--;
  }
  while (bb) {
    ans.push_back(b.front());
    b.pop();
    bb--;
  }
  while (cc) {
    ans.push_back(c.front());
    c.pop();
    cc--;
  }
  while (dd) {
    ans.push_back(d.front());
    d.pop();
    dd--;
  }
  for (auto i : ans) cout << i + 1 << " ";
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  cin >> sa;
  cin >> sb;
  for (int i = 0; i < int(sa.size()); i++) {
    if (sa[i] == '0' and sb[i] == '0') {
      a.push(i);
    } else if (sa[i] == '0' and sb[i] == '1') {
      b.push(i);
    } else if (sa[i] == '1' and sb[i] == '0') {
      c.push(i);
    } else {
      d.push(i);
    }
    vec.push_back({sa[i], sb[i]});
  }
  for (int aa = 0; aa <= int(a.size()); aa++) {
    for (int dd = 0; dd <= int(d.size()); dd++) {
      if (aa - dd == (n / 2 - int(b.size()) - int(d.size()))) {
        for (int bb = 0; bb <= int(b.size()); bb++) {
          for (int cc = 0; cc <= int(c.size()); cc++) {
            if (aa + dd + bb + cc == n / 2 and
                (dd + cc == (int(d.size()) - dd + int(b.size()) - bb))) {
              solve(aa, bb, cc, dd);
              return 0;
            }
          }
        }
      }
    }
  }
  cout << -1 << "\n";
  return 0;
}
