#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,i,x,a[100001],b[100001],ans,br=1;
int main()
{
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        a[x]=i;
    }
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        if (a[x]<i) a[x]+=n;
        b[i]=a[x]-i;
    }
    sort(b+1,b+n+1);
    for(i=2;i<=n;i++)
    {
        if (b[i]==b[i-1]) br++;
        else {ans=max(ans,br);br=1;}
    }
    printf("%d\n",ans);
	return 0;
}
