use std::io::*;

mod fenwick_tree {
    use std::ops::*;
    pub struct FenwickTree<T> {
        size: usize,
        data: Vec<T>,
        identity: T,
    }
    impl<T: Copy + Clone + AddAssign + Sub<Output = T>> FenwickTree<T> {
        pub fn new(size: usize, id: T) -> FenwickTree<T> {
            FenwickTree {
                size: size,
                data: vec![id; size + 2],
                identity: id,
            }
        }
        pub fn query(&self, i: usize) -> T {
            let mut res = self.identity;
            let mut idx = i as isize - 1;
            while idx >= 0 {
                res += self.data[idx as usize];
                idx = (idx & (idx + 1)) - 1;
            }
            res
        }
        pub fn update(&mut self, i: usize, x: T) {
            let mut idx = i;
            while idx <= self.size {
                self.data[idx] += x;
                idx |= idx + 1;
            }
        }
    }
}

fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let n: usize = itr.next().unwrap().parse().unwrap();

    let mut map = vec![0; n];
    for i in 0..n {
        let a: usize = itr.next().unwrap().parse().unwrap();
        map[a - 1] = i;
    }

    let mut ans = 0;
    let mut ft = fenwick_tree::FenwickTree::new(n, 0);
    for i in 0..n {
        let b: usize = itr.next().unwrap().parse().unwrap();
        ans += i - ft.query(map[b - 1]);
        ft.update(map[b - 1], 1);
    }
    println!("{}", ans);
}