#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n;
long long a[N], b[N];
long long x;
vector<pair<int, int> > v[N << 1];
int main() {
  scanf("%d", &n);
  for (int i(1); i <= (n); ++i) {
    scanf("%lld", &x);
    a[i] = a[i - 1] + x;
  }
  for (int i(1); i <= (n); ++i) {
    scanf("%lld", &x);
    b[i] = b[i - 1] + x;
  }
  for (int i(0); i <= (n); ++i) {
    int l = 0, r = n;
    while (l + 1 < r) {
      int mid = (l + r) >> 1;
      if (b[mid] <= a[i])
        l = mid;
      else
        r = mid - 1;
    }
    int t;
    if (b[r] <= a[i])
      t = r;
    else
      t = l;
    if (a[i] >= b[t] && a[i] - b[t] < n)
      v[a[i] - b[t]].push_back(make_pair(i, t));
  }
  for (int i(0); i <= (n - 1); ++i)
    if ((int)v[i].size() > 1) {
      sort(v[i].begin(), v[i].end());
      int x1 = v[i][0].first, y1 = v[i][1].first;
      int x2 = v[i][0].second, y2 = v[i][1].second;
      printf("%d\n", y1 - x1);
      for (int j(x1 + 1); j <= (y1); ++j) printf("%d ", j);
      putchar(10);
      printf("%d\n", y2 - x2);
      for (int j(x2 + 1); j <= (y2); ++j) printf("%d ", j);
      putchar(10);
      return 0;
    }
  return 0 * puts("-1");
}
