#include <cstdio>
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

const int MaxN = 20200;

int A[MaxN], B[MaxN], n1, n2;

int main(int argc, char *argv[]){

	ifstream inFile(argv[1]);
	ifstream outFile(argv[2]);
	ifstream solFile(argv[3]);

	bool ok = true;

	solFile >> n1;
	for (int i = 0; i < n1; i++)
		solFile >> A[i];

	if (!outFile.eof()) {
		outFile >> n2;
		ok = (n1 == n2);
		for (int i = 0; i < n2 && ok; i++) 
			if (!outFile.eof()) 
				outFile >> B[i];
			else
				ok = false;
	}
	else
		ok = false;

	if (ok) {
		sort(A, A + n1);
		sort(B, B + n2);
		for (int i = 0; i < n1 && ok; i++)
			ok = (A[i] == B[i]);
	}

	if (ok)
		cout << 5;
	else
		cout << 0;

	inFile.close();
	outFile.close();
	solFile.close();
	return 0;
}