Problem: You are given two multisets A and B. Each multiset has exactly n integers each between 1 and n inclusive. Multisets may contain multiple copies of the same number.

You would like to find a nonempty subset of A and a nonempty subset of B such that the sum of elements in these subsets are equal. Subsets are also multisets, i.e. they can contain elements with equal values.

If no solution exists, print  - 1. Otherwise, print the indices of elements in any such subsets of A and B that have the same sum.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1 000 000) — the size of both multisets.

The second line contains n integers, denoting the elements of A. Each element will be between 1 and n inclusive.

The third line contains n integers, denoting the elements of B. Each element will be between 1 and n inclusive.

Output

If there is no solution, print a single integer  - 1. Otherwise, your solution should be printed on four lines.

The first line should contain a single integer ka, the size of the corresponding subset of A. The second line should contain ka distinct integers, the indices of the subset of A.

The third line should contain a single integer kb, the size of the corresponding subset of B. The fourth line should contain kb distinct integers, the indices of the subset of B.

Elements in both sets are numbered from 1 to n. If there are multiple possible solutions, print any of them.

Examples

Input

10
10 10 10 10 10 10 10 10 10 10
10 9 8 7 6 5 4 3 2 1


Output

1
2
3
5 8 10


Input

5
4 4 3 3 3
2 2 2 2 5


Output

2
2 3
2
3 5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gi() {
  T x = 0;
  bool f = 0;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = 1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f ? -x : x;
}
const int N = 1000010;
int a[N], b[N];
long long s1[N], s2[N];
map<long long, pair<int, int> > M;
int main() {
  int n = gi<int>();
  for (int i = 1; i <= n; i++) a[i] = gi<int>(), s1[i] = s1[i - 1] + a[i];
  for (int i = 1; i <= n; i++) b[i] = gi<int>(), s2[i] = s2[i - 1] + b[i];
  bool flg = 0;
  if (s1[n] > s2[n]) swap(s1, s2), flg = 1;
  for (int p = 1; p <= n; p++) {
    int q = lower_bound(s2 + 1, s2 + 1 + n, s1[p]) - s2;
    if (s2[q] - s1[p] == 0) {
      if (!flg) {
        printf("%d\n", p);
        for (int i = 1; i <= p; i++) printf("%d ", i);
        printf("\n%d\n", q);
        for (int i = 1; i <= q; i++) printf("%d ", i);
      } else {
        printf("%d\n", q);
        for (int i = 1; i <= q; i++) printf("%d ", i);
        printf("\n%d\n", p);
        for (int i = 1; i <= p; i++) printf("%d ", i);
      }
      return 0;
    }
    if (M.find(s2[q] - s1[p]) == M.end())
      M[s2[q] - s1[p]] = make_pair(p, q);
    else {
      int l1 = M[s2[q] - s1[p]].first, l2 = M[s2[q] - s1[p]].second;
      if (!flg) {
        printf("%d\n", p - l1);
        for (int i = l1 + 1; i <= p; i++) printf("%d ", i);
        printf("\n%d\n", q - l2);
        for (int i = l2 + 1; i <= q; i++) printf("%d ", i);
      } else {
        printf("%d\n", q - l2);
        for (int i = l2 + 1; i <= q; i++) printf("%d ", i);
        printf("\n%d\n", p - l1);
        for (int i = l1 + 1; i <= p; i++) printf("%d ", i);
      }
      return 0;
    }
  }
  return 0;
}