#include <bits/stdc++.h>

using namespace std;

int prim(int a, int b)
{
	while(a != b)
		if (a > b) a = a - b;
			else b = b - a;

	if(a == 1) return 0;
	return 1;
}
char s[1000011][9];
int v[1000100];
int main()
{	
	ifstream f("pairs.in");
	ofstream g("pairs.out");
	unordered_map<string, int> pereche;
	int n;
	f>>n;
	f.get();
	for (int i = 0; i < n; i++)
		{
			f>>s[i];
			f.get();
		}
	f.close();
	ifstream ff("pairs.in");
	ff>>n;
	ff.get();
	for (int i = 0; i < n; i++)
		{
			ff>>v[i];
			ff.get();
		}
	//cout<<s[2]<<" "<<v[2];

	ff.close();
	for (int i = 0; i < n - 1; i++)
		for (int j = i + 1; j < n; j++)
		{
			if(prim(v[i], v[j]) == 0)
			{
				char sir[300];
				strcat(sir, s[i]);
				strcat(sir, ",");
				strcat(sir, s[j]);
				pereche[sir] += 1;
			}
		}
	int nrperechi = 0;
	for (auto &x : pereche) nrperechi++;
	g<<nrperechi;
	return 0;
}