#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
long long used[200010],n,max1;
pair<long long, long long> a[100001],b[100001];
int main()
{
	scanf("%lld",&n);
	for(int i=1; i<=n; i++)
		scanf("%lld",&a[i].first);
	for(int i=1; i<=n; i++)
		scanf("%lld",&b[i].first);
	for(int i=1; i<=n; i++)
		a[i].second=b[i].second=i;
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	for(int i=1; i<=n; i++)
	{
		used[a[i].second-b[i].second+n]++;
		if(a[i].second-b[i].second>0) used[a[i].second-b[i].second]++;
		else used[a[i].second-b[i].second+2*n]++;
	}
	for(int i=1; i<=2*n; i++)
	{
		max1=max(max1,used[i]);
		//cout<<i<<" "<<used[i]<<endl;
	}
	printf("%lld\n",max1);
	return 0;
}
