#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

int main() {
	ifstream fin("input.txt");
	ofstream fout("output.txt");
	int n;
	fin >> n;
	vector<int>first(n);
	for (int i = 0; i < n; i++) { fin >> first[i]; }
	fin >> n;
	vector<int>second(n);
	for (int i = 0; i < n; i++) { fin >> second[i]; }

	vector<vector<int>>dp(first.size(), vector<int>(second.size()));
	for (int i = 0; i < second.size(); i++) {
		if (first[0] == second[i]) {
			dp[0][i] = 1;
		}
	}
	for (int i = 0; i < first.size(); i++) {
		if (second[0] == first[i]) {
			dp[i][0] = 1;
		}
	}

	for (int i = 1; i < first.size(); i++) {
		for (int j = 1; j < second.size(); j++) {
			if (first[i] == second[i]) {
				dp[i][j] = dp[i - 1][j - 1] + 1;
			}
			else {
				dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
			}
		}
	}

	fout << dp[first.size() - 1][second.size() - 1];
}