/*
TASK:round
LANG:C
*/



#include <stdio.h>
#define MAX 2048

int a1[MAX];
int a2[MAX];
int m[2*MAX];
int m2[2*MAX];
int n;


int main()
{  int i,j;
	int c = 0;
	int ct1 = 0, ct2 = 0;
	scanf("%i", &n);
	for (i = 0; i < n; i++)
		scanf("%i", &a1[i]);
	for (i = 0; i < n; i++)
		scanf("%i", &a2[i]);
	for (i = 0; i <n; i++)
	{  ct1 = ct2 = 0;
		//vrata 1
		for (j = 1; j < a1[i]; j++)
		{   if (m[j]) ct1++;
		}
		for (j = a1[i] - 1; j >= 1; j--)
		{	if (m[j]) ct2++;
		}
		c += (ct1<ct2)?ct1:ct2;

		//vrata 2
		ct1 = ct2 = 0;
		for (j = 1; j < (a2[i]+n)%((2*n)-1); j++)
		{   if (m2[j]) ct1++;
		}
		for (j = (a2[i]-1+n)%((2*n)-1); j > 0; j--)
		{	if (m2[j]) ct2++;
		}
		c += (ct1<ct2)?ct1:ct2;
		m[a2[i]] = m[((a2[i])+n)%((2*n)-1)] = 1;
		m[a1[i]] = m[((a1[i])+n)%((2*n)-1)] = 1;
	}

	printf("%i\n", c);
	return 0;
}
