#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
long long n,a[1001],ans=0,c[1001],idx;
vector<long long>v;
struct node
{
	long long num,idx,numa;
}b[1001];
bool cmp(node X,node Y)
{
	return X.num>Y.num;
}
bool cmpb(node X,node Y)
{
	return X.idx<Y.idx;
}
long long FastReadLongLong()
{
	long long x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')
		{
			f=-1;
		}
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=(x<<1)+(x<<3)+(c^48),c=getchar();
	}
	return x*f;
}
int main(){
	n=FastReadLongLong();
	for(int i=1;i<=n;i++)
	{
		a[i]=FastReadLongLong();
		c[i]=a[i];
	}
	for(int i=1;i<=n;i++)
	{
		b[i].num=FastReadLongLong();
		b[i].idx=i;
	}
	sort(a+1,a+n+1);
	reverse(a+1,a+n+1);
	sort(b+1,b+n+1,cmp);
	for(int i=1;i<=n;i++)
	{
		ans+=(a[i]*b[i].num);
		b[i].numa=a[i];
	}
	sort(b+1,b+n+1,cmpb);
	for(int i=1;i<=n;i++)
	{
		if(c[i]==b[i].numa)
		{
			continue;
		}
		idx=0;
		for(int j=i+1;j<=n;j++)
		{
			if(c[j]==b[i].numa)
			{
				idx=j;
				break;
			}
		}
		for(int j=idx-1;j>=i;j--)
		{
			swap(c[j],c[j+1]);
			v.push_back(j);
		}
	}
	printf("%lld\n%lld\n",ans,v.size());
	for(int i=0;i<v.size();i++)
	{
		printf("%lld ",v[i]);
	}
	return 0;
}