#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
typedef long long ll;
int n;
struct Node
{
    ll x, y;
    int id;
};
struct Node1
{
    ll x, y;
    int id;
    friend bool operator < (Node1 a, Node1 b)
    {
        if(a.y==b.y) return a.x<b.x;
        return a.y<b.y;
    }
};
bool cmp(Node a, Node b)
{
    if(a.x==b.x) return a.y > b.y;
    return a.x > b.x;
}
bool used[maxn];
Node a[maxn],aa[maxn];
int main()
{
    priority_queue<Node1>q1;
    scanf("%d",&n);
    ll sumx = 0, sumy = 0;
    for(int i=1; i<=n; i++) scanf("%I64d",&aa[i].x);
    for(int i=1; i<=n; i++) scanf("%I64d",&aa[i].y);
    for(int i=1; i<=n; i++)
    {
        a[i].x=aa[i].x;
        a[i].y=aa[i].y;
        a[i].id = i;
        sumx+=a[i].x;
        sumy += a[i].y;
    }
    sort(a+1,a+1+n,cmp);
    Node1 b;
    for(int i=1; i<=n; i+=2)
    {
        q1.push((Node1){a[i].x,a[i].y,a[i].id});
        used[q1.top().id] = 1;
        sumx -= q1.top().x*2;
        sumy -=q1.top().y*2;
        q1.pop();
        q1.push((Node1){a[i+1].x,a[i+1].y,a[i+1].id});
        if(sumx < 0&& sumy < 0) break;
    }
    if(n%2==0)
    {
        used[q1.top().id] = 1;
    }
    int cnt = 0,lastnum=0;
    for(int i=1; i<=n; i++)
    {
        if(used[i])
        {
            cnt++;
            lastnum=i;
        }
    }
    printf("%d\n",cnt);
    for(int i=1; i<=n; i++)
    {
        if(used[i])
        {
            printf("%d",i);
            if(i==lastnum) printf("\n");
            else printf(" ");
        }
    }
}