#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define int unsigned long long
//fixed << setprecision()
const int length = 1005;
int n;
pair<int, int> a[1005];
pair<int, int> b[1005];
int ans = 0;
int want[length];
int pos[length];
queue<int> q;
signed main()
{
	ios::sync_with_stdio(false);
	ans = 0;
	cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> a[i].first;
		a[i].second = i;
	}
	for(int i = 1;i <= n;i++)
	{
		cin >> b[i].first;
		b[i].second = i;
	}
	sort(a + 1, a + 1 + n);
	sort(b + 1, b + 1 + n);
	for(int i = 1;i <= n;i++)
	{
		ans += a[i].first * b[i].first;
		want[a[i].second] = b[i].second;
	}
	cout << ans << endl;
	for(int i = n;i >= 1;i--)
	{
		for(int j = 1;j < i;j++)
		{
			if(want[j] > want[j + 1])
			{
				q.push(j);
				swap(want[j], want[j + 1]);
			}
			
		}
	}
	cout << q.size() << endl;
	while(q.size())
	{
		cout << q.front() << " ";
		q.pop();
	}
	return 0;
}