#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1e5+7;
int a[LIM], b[LIM], dp[5007][5007], ma[5007][5007], n;
void subtask2() {
rep(i, n-1) if(a[i+1]==b[1] && a[i+1]>=a[i+2]) a[i+2]=a[i+1];
for(int i=n-1; i; --i) if(a[i+1]==b[1] && a[i+1]>=a[i]) a[i]=a[i+1];
int ans=0;
rep(i, n) if(a[i+1]==b[i+1]) ++ans;
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
rep(i, n) cin >> a[i+1];
rep(i, n) cin >> b[i+1];
bool ok2=true;
rep(i, n-1) if(b[i+1]!=b[i+2]) ok2=false;
if(ok2) {
subtask2();
return 0;
}
rep(i, n) {
for(int j=i; j<n; ++j) {
ma[i+1][j+1]=max(ma[i+1][j], a[j+1]);
}
}
rep(i, n) rep(j, n) {
dp[i+1][j+1]=max(dp[i+1][j], dp[i][j+1]);
if(a[i+1]==b[j+1] && ma[min(i+1, j+1)][max(i+1, j+1)]==a[i+1]) {
dp[i+1][j+1]=max(dp[i+1][j+1], dp[i+1][j]+1);
}
}
cout << dp[n][n] << '\n';
}
