#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[100001], b[100001], ans = 0, current = 0;
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 k = 0; k < n; k++)
  { for (int i = 0; i < n; i++)
    { for (int j = 0; j < n; j++)
      if (a[j] == b[j]) current++;
      
      if (current > ans) ans = current;
      current = 0;
      
      int y = b[0];
      for (int j = 0; j < n - 1; j++)
      b[j] = b[j + 1];
      b[n - 1] = y;
     }
    
    int t = a[0];
    for (int j = 0; j < n - 1; j++)
    a[j] = a[j + 1];
    a[n - 1] = t;
   }
  
  printf("%d\n", ans);
}

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