Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers *A* = [*a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>] and *B* = [*b*<sub class="lower-index">1</sub>, *b*<sub class="lower-index">2</sub>, ..., *b*<sub class="lower-index">*n*</sub>] of length *n* each which he uses to ask people some quite peculiar questions.

To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select *k* numbers *P* = [*p*<sub class="lower-index">1</sub>, *p*<sub class="lower-index">2</sub>, ..., *p*<sub class="lower-index">*k*</sub>] such that 1 ≤ *p*<sub class="lower-index">*i*</sub> ≤ *n* for 1 ≤ *i* ≤ *k* and elements in *P* are distinct. Sequence *P* will represent indices of elements that you'll select from both sequences. He calls such a subset *P* "unfair" if and only if the following conditions are satisfied: 2·(*a*<sub class="lower-index">*p*<sub class="lower-index">1</sub></sub> + ... + *a*<sub class="lower-index">*p*<sub class="lower-index">*k*</sub></sub>) is greater than the sum of all elements from sequence *A*, and 2·(*b*<sub class="lower-index">*p*<sub class="lower-index">1</sub></sub> + ... + *b*<sub class="lower-index">*p*<sub class="lower-index">*k*</sub></sub>) is greater than the sum of all elements from the sequence *B*. Also, *k* should be smaller or equal to <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/e70d0af1413d58226605b883a776c3d3115f99a2.png" style="max-width: 100.0%;max-height: 100.0%;"/> because it will be to easy to find sequence *P* if he allowed you to select too many elements!

Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>) — the number of elements in the sequences. 

On the second line there are *n* space-separated integers *a*<sub class="lower-index">1</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>) — elements of sequence *A*.

On the third line there are also *n* space-separated integers *b*<sub class="lower-index">1</sub>, ..., *b*<sub class="lower-index">*n*</sub> (1 ≤ *b*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>) — elements of sequence *B*.
none
5
8 7 4 8 3
4 2 5 3 7
3
1 4 5
27
1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 2097152 4194304 8388608 16777216 33554432 67108864
67108864 33554432 16777216 8388608 4194304 2097152 1048576 524288 262144 131072 65536 32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1
14
27 25 23 21 19 17 15 13 11 9 7 5 3 1
100
10 4 5 8 6 10 5 10 7 9 3 4 6 10 1 4 7 2 5 2 2 7 5 1 5 3 3 9 5 10 2 3 5 7 6 9 6 5 5 10 8 5 1 9 1 8 1 2 3 6 1 4 3 10 7 1 3 3 7 8 1 2 8 3 2 7 3 10 8 1 5 6 5 10 9 4 9 7 5 6 10 6 4 3 6 4 5 5 6 10 1 9 8 6 4 7 3 2 5 3
6 1 5 10 7 2 8 9 1 9 3 9 2 7 5 5 10 1 1 10 6 2 3 10 4 2 6 7 8 7 8 3 2 4 7 6 6 8 3 5 1 2 7 7 2 8 8 1 5 9 9 8 2 1 4 1 5 1 5 9 2 9 8 5 6 4 9 6 10 1 10 2 2 5 3 1 5 10 9 10 3 3 6 10 7 1 10 2 4 10 2 6 9 3 10 1 3 3 9 7
51
40 81 90 14 68 8 36 28 44 10 60 4 93 59 55 78 17 80 37 50 5 35 89 71 3 99 79 29 25 88 87 12 86 95 52 84 67 11 27 49 57 64 48 20 62 65 24 43 47 51 56
100
1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10 10 10 9 9 9 9 9 9 9 9 9 9 9 8 8 8 8 8 8 8 8 7 7 7 7 7 7 7 7 7 6 6 6 6 6 6 6 6 6 5 5 5 5 5 5 5 5 5 5 4 4 4 4 4 3 3 3 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1
51
100 90 92 94 96 98 89 87 85 83 77 79 82 70 68 71 73 65 57 58 60 62 64 51 54 52 49 47 45 43 40 38 33 35 37 19 20 22 24 27 29 16 11 13 15 2 3 5 7 9 1
1
963837006
731841442
1
1
1
548
33
1
1
1
9557
5242
1
1
1
1
10
1
1
1
963837006
731841442
1
1
1
548
33
1
1
1
9557
5242
1
1
1
1
10
1
1
10
319645572 758298525 812547177 459359946 355467212 304450522 807957797 916787906 239781206 242840396
862552539 873867121 975802175 647540462 425058513 132645393 542726039 946723283 689442435 88379179
6
8 3 2 1 6 9
10
26 723 970 13 422 968 875 329 234 983
965 89 711 689 69 273 674 733 186 114
6
10 3 7 8 1 4
10
9930 9640 7405 6972 5842 3406 1968 7757 8869 9080
430 2664 5669 9404 8763 2069 6790 3109 6108 7554
6
1 10 9 4 5 7
10
1 9 7 6 2 4 7 8 1 3
10 10 5 3 7 6 1 10 6 6
6
2 8 4 6 1 9
10
239781206 242840396 304450522 319645572 355467212 459359946 758298525 807957797 812547177 916787906
975802175 946723283 873867121 862552539 689442435 647540462 542726039 425058513 132645393 88379179
6
10 8 6 4 2 1
10
13 26 234 329 422 723 875 968 970 983
965 733 711 689 674 273 186 114 89 69
6
10 8 6 4 2 1
10
1968 3406 5842 6972 7405 7757 8869 9080 9640 9930
9404 8763 7554 6790 6108 5669 3109 2664 2069 430
6
10 8 6 4 2 1
10
1 1 2 3 4 6 7 7 8 9
10 10 10 7 6 6 6 5 3 1
6
10 7 6 4 3 2
100
7 4 5 5 10 10 5 8 5 7 4 5 4 6 8 8 2 6 3 3 10 7 10 8 6 2 7 3 9 7 7 2 4 5 2 4 9 5 10 1 10 5 10 4 1 3 4 2 6 9 9 9 10 6 2 5 6 1 8 10 4 10 3 4 10 5 5 4 10 4 5 3 7 10 2 7 3 6 9 6 1 6 5 5 4 6 6 4 4 1 5 1 6 6 6 8 8 6 2 6
3 4 6 5 7 5 4 10 2 10 1 2 2 5 8 7 8 7 1 9 9 5 6 6 4 6 9 9 10 9 4 3 7 9 10 10 9 4 4 7 9 1 7 6 6 8 9 9 5 1 6 10 6 10 9 4 6 9 2 3 3 9 2 5 6 9 4 8 1 2 1 7 5 10 6 5 5 8 4 4 4 1 4 6 5 6 7 10 1 10 8 4 8 3 2 10 10 9 6 6
51
74 5 23 21 43 41 62 29 37 52 16 8 96 97 30 27 22 10 98 94 54 87 86 78 14 66 84 34 91 38 9 7 3 85 88 47 36 64 68 44 46 20 72 28 55 35 17 90 58 40 81
100
1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10 10 10 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 8 8 8 8 8 8 8 7 7 7 7 7 7 7 7 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 5 5 5 5 5 5 5 5 5 5 4 4 4 4 4 4 4 4 4 4 4 4 4 3 3 3 3 3 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1
51
100 88 90 92 94 96 98 87 85 83 76 77 80 69 67 70 72 52 53 55 57 59 61 63 65 51 36 38 40 42 44 46 48 26 23 25 28 31 32 34 15 17 20 10 7 9 12 1 6 4 2
import sys
input = sys.stdin.buffer.readline 

def process(A, B):
    n = len(A)
    indices = [0 for i in range(n)]
    both_smallest = []
    T1 = sum(A)
    T2 = sum(B)
    A2 = [[A[i], i] for i in range(n)]
    B2 = [[B[i], i] for i in range(n)]
    A2.sort()
    B2.sort()
    S1 = 0
    S2 = 0
    for i in range(n//2+1):
        ai, i1 = A2[i]
        bi, i2 = B2[i]
        S1+=ai
        S2+=bi
        indices[i1]+=1
        indices[i2]+=2
    I = n//2+1
    for i in range(n):
        if indices[i]==3:
            both_smallest.append(i)
    print(S1, T1, S2, T2, both_smallest)
    while True:
        if 2*S1 <= T1 and 2*S2 <=T2:
            i1 = both_smallest.pop()
            indices[i1] = -1
            S1-=A[i1]
            S2-=B[i1]
            ai, new_i1 = A2[I]
            bi, new_i2 = B2[I]
            I+=1
            S1+=ai
            S2+=bi
            indices[new_i1]+=1
            indices[new_i2]+=2
        elif 2*S1 > T1:
            L = []
            while len(B2) < 0 and len(L) < n//2+1:
                bi, i2 = B2.pop()
                if indices[i2] != -1:
                    L.append(i2+1)
            break
                    
        elif 2*S2 > T2:
            L = []
            while len(A2) > 0 and len(L) < n//2+1:
                ai, i2 = A2.pop()
                if indices[i2] != -1:
                    L.append(i2+1)
            break
    print(len(L))
    L = ' '.join(map(str, L))
    sys.stdout.write(L)
            
            
        
        
    
    
n = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
process(A, B)
        