#include <bits/stdc++.h>
using namespace std;
const int mxn = 1000001;
int n;
pair<int, int> a[mxn], b[mxn];
long long sa[mxn], sb[mxn], first[mxn], dp[mxn];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i].first, a[i].second = i, dp[i] = -1;
  for (int i = 1; i <= n; i++) cin >> b[i].first, b[i].second = i;
  sort(a + 1, a + n + 1);
  sort(b + 1, b + n + 1);
  for (int i = 1; i <= n; i++) {
    sa[i] = a[i].first + sa[i - 1];
    sb[i] = b[i].first + sb[i - 1];
  }
  for (int i = 1; i <= n; i++) {
    first[i] = first[i - 1];
    while (first[i] < n && sb[first[i] + 1] <= sa[i]) first[i]++;
    int x = sa[i] - sb[first[i]];
    if (~dp[x]) {
      cout << (i - dp[x]) << '\n';
      cout << a[i].second;
      for (int j = i - 1; j > dp[x]; j--) cout << " " << a[j].second;
      cout << '\n';
      cout << (first[i] - first[dp[x]]) << '\n';
      cout << b[first[i]].second;
      for (int j = first[i] - 1; j > first[dp[x]]; j--)
        cout << " " << b[j].second;
      cout << '\n';
      return 0;
    }
    dp[x] = i;
  }
  cout << -1 << '\n';
  return 0;
}
