#include <bits/stdc++.h>
using namespace std;
long long n, i, j, k, x, y, z, l, r, mid, q, ans, mod = 998244353, t, m;
vector<long long> v[200005];
long long a[11][100005], b[11][100005];
string s[2];
char ch;
int main() {
  ios::sync_with_stdio(NULL);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> s[0] >> s[1];
  for (i = 0; i < n; i++) {
    x = (s[0][i] - '0') * 2 + (s[1][i] - '0');
    v[x].push_back(i + 1);
  }
  for (i = 0; i <= v[2].size(); i++)
    for (j = 0; j <= v[3].size(); j++) {
      x = v[1].size() + v[3].size() - i - j * 2;
      if (x < 0 || v[1].size() < x ||
          v[1].size() - x + v[3].size() - j != i + j || x + i + j > n / 2 ||
          n / 2 - x - i - j > v[0].size())
        continue;
      for (k = 0; k < i; k++) cout << v[2][k] << " ";
      for (k = 0; k < j; k++) cout << v[3][k] << " ";
      for (k = 0; k < x; k++) cout << v[1][k] << " ";
      x = n / 2 - i - j - x;
      for (k = 0; k < x; k++) cout << v[0][k] << " ";
      return 0;
    }
  cout << -1;
}
