#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize(2)
int a[1005],b[1005],l[1005];
vector<int> ans;
struct node{
	int key,val;
} c[1005],d[1005];
bool cmp(node a,node b){return a.val<b.val;}
struct ys{
	int u,v;
};
ys p[1005];
bool cmp2(ys a,ys b){return a.v<b.v;}
void bubble(int n){
	for(int i=1;;i++){
		bool k=1;
		for(int j=1;j<=n-i;j++){
			if(l[j]>l[j+1]){
				ans.push_back(j);
				k=0;
				swap(l[j],l[j+1]);
			}
		}
		if(k) return;
	}
}
signed main(){
	int n;
	scanf("%lld",&n);
	for(int i=1;i<=n;i++) scanf("%lld",a+i),c[i].key=i,c[i].val=a[i];
	for(int i=1;i<=n;i++) scanf("%lld",b+i),d[i].key=i,d[i].val=b[i];
	sort(c+1,c+n+1,cmp);
	sort(d+1,d+n+1,cmp);
	int cnt=0;
	for(int i=1;i<=n;i++) cnt+=c[i].val*d[i].val,p[i].u=c[i].key,p[i].v=d[i].key;
	printf("%lld\n",cnt);
	sort(p+1,p+n+1,cmp2);
	for(int i=1;i<=n;i++) l[p[i].u]=i;
	bubble(n);
	printf("%lld\n",(int)ans.size());
	for(auto i:ans) printf("%lld ",i);
	return 0;
}