#include <bits/stdc++.h>
using namespace std;
long long n, a[1000003], b[1000003], sa[1000003], sb[1000003], vis[1000003],
    v[1000003], sum, che;
signed main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    sa[i] = sa[i - 1] + a[i];
  }
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &b[i]);
    sb[i] = sb[i - 1] + b[i];
  }
  if (sa[n] < sb[n]) swap(sa, sb), che = 1;
  for (long long i = 1; i <= n; i++) {
    while (sa[i] >= sb[sum + 1] && sum < n) sum++;
    if (sa[i] == sb[sum]) {
      if (che == 0) {
        cout << i << endl;
        for (long long j = 1; j <= i; j++) cout << j << " ";
        cout << endl << sum << endl;
        for (long long j = 1; j <= sum; j++) cout << j << " ";
      } else {
        cout << sum << endl;
        for (long long j = 1; j <= sum; j++) cout << j << " ";
        cout << endl << i << endl;
        for (long long j = 1; j <= i; j++) cout << j << " ";
      }
      return 0;
    }
    if (vis[sa[i] - sb[sum]] == 0)
      vis[sa[i] - sb[sum]] = i, v[sa[i] - sb[sum]] = sum;
    else {
      if (che == 0) {
        cout << i - vis[sa[i] - sb[sum]] << endl;
        for (long long j = vis[sa[i] - sb[sum]] + 1; j <= i; j++)
          cout << j << " ";
        cout << endl << sum - v[sa[i] - sb[sum]] << endl;
        for (long long j = v[sa[i] - sb[sum]] + 1; j <= sum; j++)
          cout << j << " ";
      } else {
        cout << sum - v[sa[i] - sb[sum]] << endl;
        for (long long j = v[sa[i] - sb[sum]] + 1; j <= sum; j++)
          cout << j << " ";
        cout << endl << i - vis[sa[i] - sb[sum]] << endl;
        for (long long j = vis[sa[i] - sb[sum]] + 1; j <= i; j++)
          cout << j << " ";
      }
      return 0;
    }
  }
  return 0;
}
