#include <iostream>
#include <cstdio>
using namespace std;
int n, a[1<<17], b[1<<17], ans;
int wayA[1<<12][1<<12], wayB[1<<12][1<<12];
int main(){
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        scanf("%d", a+i);
    for(int i = 1; i <= n; i++)
        scanf("%d", b+i);
    if(n <= 3000){
        for(int i = 1; i <= n; i++)
          for(int j = i + 1; j <= n; j++)
            wayA[a[i]][a[j]] = i-j ,
            wayA[a[j]][a[i]] = j-i;
        for(int i = 1; i <= n; i++)
          for(int j = i + 1; j <= n; j++)
            wayB[b[i]][b[j]] = i-j ,
            wayB[b[j]][b[i]] = j-i;
        for(int i = 1; i <= n; i++){
            int cnt = 0;
            for(int j = 1; j <= n; j++)
                cnt += (wayA[i][j] == wayB[i][j]);
            ans = max(ans, cnt);
            //cout<<cnt<<" "<<i<<endl;
        }
    }
    else {

    }
    printf("%d\n", ans);
    return 0;
}
