#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[4], n;
char s1[5005], s2[5005];
int p[2][4];
vector<int> ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> s1 >> s2;
  for (int i = 0; i < n; i++) {
    a[(s1[i] - '0') * 2 + (s2[i] - '0')]++;
  }
  for (int k = 0; k <= n / 2; k++) {
    for (int x = 0; x <= a[3]; x++) {
      memset(p, 0, sizeof(p));
      p[0][3] = x;
      p[1][3] = a[3] - x;
      p[0][2] = k - x;
      p[1][2] = a[2] - p[0][2];
      p[1][1] = k - p[1][3];
      p[0][1] = a[1] - p[1][1];
      p[0][0] = n / 2 - p[0][1] - p[0][2] - p[0][3];
      p[1][0] = n / 2 - p[1][1] - p[1][2] - p[1][3];
      int yes = 1;
      for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 4; j++) {
          if (p[i][j] < 0) yes = 0;
        }
      }
      if (!yes) continue;
      for (int i = 0; i < n; i++) {
        int y = (s1[i] - '0') * 2 + (s2[i] - '0');
        if (p[0][y]) {
          ans.push_back(i + 1);
          p[0][y]--;
        }
      }
      if (!ans.empty()) break;
    }
    if (!ans.empty()) break;
  }
  if (ans.size()) {
    for (int x : ans) cout << x << ' ';
  } else
    cout << -1;
}
