#include #define pb push_back #define mp make_pair #define mt make_tuple #define ll long long #define pii pair #define tii tuple #define N 100005 #define mod 2000003 #define X first #define Y second #define eps 0.0000000001 #define all(x) x.begin(),x.end() #define tot(x) x+1,x+n+1 using namespace std; int sol,sau,i,k,n,p[50050],x; setv; int main() { cin>>n; for(i=1;i<=n;i++) { cin>>x; p[x]=n-i+1; } for(i=1;i<=n;i++) { cin>>x; sol+=v.size()-distance(v.begin(),v.lower_bound(p[x])); v.insert(p[x]);; } cout<