#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
int n = 0;

int a[N], b[N], s[N], ls[N];
void add(int x, int v) {
    for(; x<=n; x+=x&(-x)) s[x] = max(s[x], v); 
}

int query(int x) {
    int ans = 0;
    for(; x>0; x-=x&(-x)) ans = max(ans, s[x]);
    return ans;
}
int main() {
    //freopen("p1020_1.in", "r", stdin);
    for(; scanf("%d", a+n+1) != EOF; ++n, b[n] = a[n]);
    
    sort(b+1, b+n+1);
    int t = unique(b+1, b+n+1) - (b+1);
    
    for(int i=1; i<=n; ++i) 
        a[i] = lower_bound(b+1, b+t+1, a[i]) - b;
    
    int ans = 0;
    for(int i=n; i>0; --i) {
        int q = query(a[i]) + 1;
        add(a[i], q);
        ans = max(ans, q);
    }
    printf("%d\n", ans);
    
    ans = 0;
    memset(s, 0, sizeof s);
    for(int i=1; i<=n; ++i) {
        int q = query(a[i]-1) + 1;
        add(a[i], q);
        ans = max(ans, q);
    }
    printf("%d\n", ans);
    return 0;
}

#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;

const int N = 100010;

int n, b[N], p1[N], p2[N], s[N];

int lowbit(int x) {
    return x&(-x);
}
void add(int x, int v) {
    for(; x <= n; x += lowbit(x)) s[x] = max(s[x], v);
}
int query(int x) {
    int ans = 0;
    for(; x > 0; x -= lowbit(x)) ans = max(ans, s[x]);
    return ans;
}
int main() {
    
    scanf("%d", &n);
    for(int i=1; i<=n; ++i) scanf("%d", p1+i);
    for(int i=1; i<=n; ++i) scanf("%d", p2+i);
    
    for(int i=1; i<=n; ++i) b[p1[i]] = i;
    for(int i=1; i<=n; ++i) p2[i] = b[p2[i]];
    
    int ans = 0;
    for(int i=1; i<=n; ++i) {
        int q = query(p2[i]-1) + 1;
        add(p2[i], q);
        ans = max(ans, q);
    }
    
    printf("%d", ans);
    return 0;
}