#include <iostream>
#include <cstdio>
using namespace std;

const int MAXN = 100000;
int n;

int seq[2][MAXN];

void read() {
    scanf("%d", &n);
    for(int t = 0; t < 2; t++) {
        for(int i = 0; i < n; i++) {
            scanf("%d", &seq[t][i]);
        }
    }
}

void solve() {
    int max = -1, curr;
    for(int off = 0; off < n; off++) {
        curr = 0;
        for(int i = 0; i < n; i++) {
            if(seq[0][i] == seq[1][(i+off)%n]) {
                curr++;
            }
        }

        if(curr > max) {
            max = curr;
        }
    }

    printf("%d\n", curr);
}

int main() {
    read();
    solve();

    return 0;
}
