#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
typedef long long LL;
int n;
LL arr[1005],brr[1005],ays[1005],ayd[1005],bys[1005],byd[1005],bye[1005],byy[1005],ans=0;
vector<LL> op;
void fun(){
    LL x;
    for (int i=2;i<=n;++i){
        x=i;
        while ((x>1)&&(byy[x]<byy[x-1])){swap(byy[x],byy[x-1]);op.emplace_back(--x);}
    }
}
void output(){
    bool ok=0;printf("%lu\n",op.size());for (auto &&i : op){if (ok){putchar(' ');}else{ok=1;}printf("%lld",i);}
}
bool acmp(LL x,LL y){return arr[x]<arr[y];}
bool bbbcmp(LL x,LL y){return brr[x]<brr[y];}
bool ccmp(pair<LL,LL> x,pair<LL,LL> y){return x.second<y.second;}
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;++i){scanf("%lld",arr+i);ays[i]=i;}for (int i=1;i<=n;++i){scanf("%lld",brr+i);bys[i]=i;}
    sort(ays+1,ays+1+n,acmp);sort(bys+1,bys+1+n,bbbcmp);
    for (int i=1;i<=n;++i){byd[bys[i]]=i;ayd[ays[i]]=i;}
    sort(arr+1,arr+1+n);sort(brr+1,brr+1+n);
    for (int i=1;i<=n;++i){bye[byd[i]]=i;}
    for (int i=1;i<=n;++i){byy[i]=bye[ayd[i]];}
    for (LL i=1;i<=n;++i){ans+=(arr[i]*brr[i]);}
    printf("%lld\n",ans);
    fun();output();
    return 0;
}