#include <bits/stdc++.h>
using namespace std;
int a[5500], c[5500];
queue<int> que;
int main() {
  int n;
  while (cin >> n) {
    string s1, s2;
    cin >> s1;
    for (int i = 0; i < s1.size(); i++) {
      if (s1[i] == '0')
        a[i + 1] = 0;
      else
        a[i + 1] = 1;
    }
    cin >> s2;
    for (int i = 0; i < s2.size(); i++) {
      if (s2[i] == '0')
        c[i + 1] = 0;
      else
        c[i + 1] = 1;
    }
    int A = 0, B = 0, C = 0, D = 0;
    for (int i = 1; i <= n; i++) {
      if (a[i] == 0 && c[i] == 0) A++;
      if (a[i] == 0 && c[i] == 1) B++;
      if (a[i] == 1 && c[i] == 0) C++;
      if (a[i] == 1 && c[i] == 1) D++;
    }
    bool flag = false;
    int num1, num2, num3, num4;
    for (int i = 0; i <= A; i++) {
      num1 = i;
      num4 = B + D + i - n / 2;
      for (int j = 0; j <= B; j++) {
        num2 = j;
        num3 = n / 2 - num1 - num2 - num4;
        if ((num1 + num2 + num3 + num4) == n / 2 && num1 <= A && num2 <= B &&
            num3 <= C && num4 <= D && num1 >= 0 && num2 >= 0 && num3 >= 0 &&
            num4 >= 0) {
          flag = true;
          break;
        }
        if (flag) break;
      }
      if (flag) break;
    }
    if (!flag)
      cout << "-1" << endl;
    else {
      int nn = 1;
      while (num1) {
        if (a[nn] == 0 && c[nn] == 0) {
          que.push(nn);
          num1--;
        }
        nn++;
      }
      nn = 1;
      while (num2) {
        if (a[nn] == 0 && c[nn] == 1) {
          que.push(nn);
          num2--;
        }
        nn++;
      }
      nn = 0;
      while (num3) {
        if (a[nn] == 1 && c[nn] == 0) {
          que.push(nn);
          num3--;
        }
        nn++;
      }
      nn = 0;
      while (num4) {
        if (a[nn] == 1 && c[nn] == 1) {
          que.push(nn);
          num4--;
        }
        nn++;
      }
      int mm = 0;
      while (!que.empty()) {
        if (mm == 0)
          cout << que.front();
        else
          cout << " " << que.front();
        que.pop();
        mm++;
      }
      cout << endl;
    }
  }
}
