#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<string.h>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int n, a[200002], b[200002], indexes[200003], t = 0, ans = 0, current = 1, current1 = 0, AllIndexes[200002], AllIndexes1[200002];
int Razliki[200002];
void in()
{ scanf("%d", &n);
  for (int i = 0; i < n; i++)
  scanf("%d", &a[i]);
  
  for (int i = 0; i < n; i++)
  scanf("%d", &b[i]);
}

void make()
{ for (int i = n; i < 2 * n; i++)
  { a[i] = a[i - n]; b[i] = b[i - n]; indexes[b[i]] = i - n; }
  
  for (int i = 0; i < n; i++)
  { AllIndexes[a[i]] = i; AllIndexes1[b[i]] = i; }
    //if (b[i] == n) cout << "a[i] = " << a[i] << " AllIndexes[a[i]] = " << AllIndexes[a[i]] << " b[i] = " << b[i] << " AllIndexes1[b[i]] = " << AllIndexes1[b[i]] << endl; }
  
  /*for (int i = 0; i < 2 * n; i++)
  cout << AllIndexes[i] << ' ' << AllIndexes1[i] << ' ' << i << endl;
  cout << endl << endl << endl;*/
  
  //for (int i = n + 1; i < 2 * n; i++)
  //{ AllIndexes[i] = AllIndexes[a[i - n - 1]]; AllIndexes1[i] = AllIndexes1[b[i - n - 1]]; }
  
  /*for (int i = 1; i < (2 * n) - 1; i++)
  cout << AllIndexes[i] << ' ' << AllIndexes1[i] << ' ' << i << endl;
  cout << AllIndexes[2 * n - 1] << ' ' << AllIndexes1[2 * n - 1] << ' ' << 2 * n - 1 << endl;
  cout << endl << endl << endl;*/
  
  for (int i = 1; i <= n; i++)
  Razliki[i] = AllIndexes[i] - AllIndexes1[i];
  
  /*for (int i = 1; i < n; i++)
  cout << Razliki[i] << ' ';
  cout << Razliki[n] << endl;*/
  
  sort(Razliki, Razliki + n);
  for (int i = 1; i < n; i++)
  { if (Razliki[i] == Razliki[i + 1]) current++;
    else
    { if (current > ans) ans = current;
      current = 1;
     }
   }
  
  if (n == 2)
  { reverse(a, a + n);
    for (int i = 0; i < n; i++)
    if (a[i] == b[i]) current1++;
   }
  
  /*int y = indexes[a[0]];
  for (int i = 0; i < n; i++)
  if (a[i] == b[y++]) current++;*/
  
  //printf("%d\n", ans);
  cout << max(current, current1) << endl;
}

int main()
{ 
  in();
  make();
  
  //cin >> n;
  return 0;
}
