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

const int MAXN = 100000;
int n;

int seq[MAXN][2];
int off[MAXN];

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

void solve() {
    int curroff;
    for(int i = 0; i < n; i++) {
        curroff = (seq[i][0] + n - seq[i][1])%n;
        //cout << curroff << endl;
        off[curroff]++;
    }

    int max = -1;
    for(int i = 0; i < n; i++) {
        if(off[i] > max) {
            max = off[i];
        }
    }

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

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

    return 0;
}

