#include <stdio.h>

#define MAX_N (30)

int p[2][MAX_N], inv[MAX_N+1];

int main(int argc, char *noargs[]) {
  int i, j, n, res;
  for (;;) {
    if (scanf("%d", &n) == EOF) break;
    for (i = 0; i < 2; ++i) {
      for (j = 0; j < n; ++j) {
	scanf("%d", &p[i][j]);
      }
    }
    for (i = 0; i < n; ++i) {
      inv[p[0][i]] = i;
    }
    res = 0;
    for (i = 0; i < n; ++i) {
      for (j = i+1; j < n; ++j) {
	if (inv[p[1][i]] > inv[p[1][j]]) ++res;
      }
    }
    printf("%d\n", res);
  }
  return 0;
}