#include <stdio.h>
void qsort(int arr[],int left, int right){
	int i=left; int j =right;
	int tmp;
	int pivot = arr[(left+right)/2];
	while(i <= j){
		while(arr[i]<pivot) {
			i++;
		}
		while(arr[j]>pivot){
			j--;
		}
		if(i <= j){
			tmp = arr[i];
			arr[i] = arr[j];
			arr[j] = tmp;
			i++;
			j--;
		}
	}
	if(i < right){
		qsort(arr,i,right);
	}
	if(left < j){
		qsort(arr,left,j);
	}
}
void cpy(int arr1[],int arr2[],int N){
	for(int i=0; i<N; i++){
		arr1[i]= arr2[i];
		//printf("%d ",arr1[i]);
	}
	//printf("\n");
}
void qsortseq(int arr[],int left, int right,int seq[]){
	int i=left; int j =right;
	int tmp;
	int stmp;
	int pivot = arr[(left+right)/2];
	while(i <= j){
		while(arr[i]>pivot) {
			i++;
		}
		while(arr[j]<pivot){
			j--;
		}
		if(i <= j){
			tmp = arr[i];
			stmp = seq[i];
			arr[i] = arr[j];
			seq[i] = seq[j];
			arr[j] = tmp;
			seq[j] = stmp;
			i++;
			j--;
		}
	}
	if(i < right){
		qsortseq(arr,i,right,seq);
	}
	if(left < j){
		qsortseq(arr,left,j,seq);
	}
}
int main(void) {
	int N;
	scanf("%d",&N);
	int A[51];
	int B[51];
	int C[51];
	for(int i=0; i<N; ++i){
		scanf("%d",&A[i]);
	//	printf("%d ",A[i]);
	}
	//printf("\n");
	for(int i=0; i<N; ++i){
		scanf("%d",&B[i]);
	//	printf("%d ",B[i]);
	}	
	qsort(A,0,N-1);
 
	int seq[51];
	for(int i=0; i<N; ++i){
		seq[i]=i;
	//	printf("%d ",seq[i]);
	}
	//printf("\n");
	cpy(C,B,N);
	qsortseq(C,0,N-1,seq);
 
 
	int sum=0;
	for(int i=0; i<N; i++){
		int tmp = A[i]*B[seq[i]];
		//printf("%dx%d=%d\n",A[i],B[seq[i]],tmp);
		sum += tmp;
	}
	printf("%d",sum);
 
 
	return 0;
}