//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 300005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n;
int a[N], b[N], c[N];
int pa[N], pb[N], pc[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        pa[a[i]] = i;
    }
    for(int i=1; i<=n; i++){
        cin >> b[i];
        pb[b[i]] = i;
    }
    for(int i=1; i<=n; i++){
        cin >> c[i];
        pc[c[i]] = i;
    }
}

map<ii,int> cnt;

void proc()
{
    int ans = 1;
    for(int i=1; i<=n; i++){
        int change1=0;
        if (pb[i] > pa[i]){
            change1 += n-pb[i]+pa[i];
        }
        else change1 += pa[i]-pb[i];
        int change2 = 0;
        if (pc[i] > pa[i]){
            change2 += n-pc[i]+pa[i];
        }
        else change2 += pa[i]-pc[i];
        cnt[ii(change1,change2)]++;
        ans = max(ans,cnt[ii(change1,change2)]);
    }
    cout << ans;
}

signed main()
{
    readfile();
    proc();
    return 0;
}